Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rajat Modi

dblp:318/2792 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 49% Transfer learning and domain adaptation · 18% Representation and self-supervised learning · 18%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › novelty detection
out-of-distribution recognition
0.812024
Asynchronous Perception Machine for Efficient Test Time Training · NeurIPS 2024
Machine learning › Representation and self-supervised learning
semantic clustering
0.812024
Asynchronous Perception Machine for Efficient Test Time Training · NeurIPS 2024
Machine learning › Transfer learning and domain adaptation › test-time adaptation
test-time training
0.812024
Asynchronous Perception Machine for Efficient Test Time Training · NeurIPS 2024
Computer vision › Video understanding and tracking
action detection
0.712023
On Occlusions in Video Action Detection: Benchmark Datasets And Training Recipes · NeurIPS 2023
Machine learning › Trustworthy machine learning › robustness › corruption robustness
occlusion robustness
0.712023
On Occlusions in Video Action Detection: Benchmark Datasets And Training Recipes · NeurIPS 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
On Occlusions in Video Action Detection: Benchmark Datasets And Training Recipes · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

representation distillation · 0.8transformer · 0.7capsule network · 0.7
YearPublicationVenuePosition
2024 Asynchronous Perception Machine for Efficient Test Time Training
abstract
In this work, we propose Asynchronous Perception Machine (APM), a computationally-efficient architecture for test-time-training (TTT). APM can process patches of an image one at a time in any order asymmetrically and still encode semantic-awareness in the net. We demonstrate APM's ability to recognize out-of-distribution images without dataset-specific pre-training, augmentation or any-pretext task. APM offers competitive performance over existing TTT approaches. To perform TTT, APM just distills test sample's representation once. APM possesses a unique property: it can learn using just this single representation and starts predicting semantically-aware features. APM demostrates potential applications beyond test-time-training: APM can scale up to a dataset of 2D images and yield semantic-clusterings in a single forward pass. APM also provides first empirical evidence towards validating GLOM's insight, i.e. input percept is a field. Therefore, APM helps us converge towards an implementation which can do both interpolation and perception on a shared-connectionist hardware. Our code is publicly available at https://rajatmodi62.github.io/apm_project_page/ -------- **It now appears that some of the ideas in GLOM could be made to work.** https://www.technologyreview.com/2021/04/16/1021871/geoffrey-hinton-glom-godfather-ai-neural-networks/ GLOM = Geoff's Latest Original Model. ``` .-""""""-. .' '. / O O \ | O | \ '------' / '. .' '-....-' Silent men in deep-contemplation. Silent men emerges only sometimes. Silent men love all. Silent men practice slow science. ```
Rajat Modi, Yogesh S. Rawat
NeurIPS1
2023 On Occlusions in Video Action Detection: Benchmark Datasets And Training Recipes
abstract
This paper explores the impact of occlusions in video action detection. We facilitatethis study by introducing five new benchmark datasets namely O-UCF and O-JHMDB consisting of synthetically controlled static/dynamic occlusions, OVIS-UCF and OVIS-JHMDB consisting of occlusions with realistic motions and Real-OUCF for occlusions in realistic-world scenarios. We formally confirm an intuitiveexpectation: existing models suffer a lot as occlusion severity is increased andexhibit different behaviours when occluders are static vs when they are moving.We discover several intriguing phenomenon emerging in neural nets: 1) transformerscan naturally outperform CNN models which might have even used occlusion as aform of data augmentation during training 2) incorporating symbolic-componentslike capsules to such backbones allows them to bind to occluders never even seenduring training and 3) Islands of agreement (similar to the ones hypothesized inHinton et Al’s GLOM) can emerge in realistic images/videos without instance-levelsupervision, distillation or contrastive-based objectives(eg. video-textual training).Such emergent properties allow us to derive simple yet effective training recipeswhich lead to robust occlusion models inductively satisfying the first two stages ofthe binding mechanism (grouping/segregation). Models leveraging these recipesoutperform existing video action-detectors under occlusion by 32.3% on O-UCF,32.7% on O-JHMDB & 2.6% on Real-OUCF in terms of the vMAP metric. The code for this work has been released at https: //github.com/rajatmodi62/OccludedActionBenchmark.
Rajat Modi, Vibhav Vineet, Yogesh S. Rawat
NeurIPS1