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

Nidhi Hegde 0003

dblp:357/5607 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Efficient and distributed learning · 56% Deep learning architectures and training · 28% Image recognition and object detection · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
adaptive computation
0.812024
Mixture of Nested Experts: Adaptive Processing of Visual Tokens · NeurIPS 2024
Machine learning › Deep learning architectures and training
mixture of experts
0.812024
Mixture of Nested Experts: Adaptive Processing of Visual Tokens · NeurIPS 2024
Computer vision › Image recognition and object detection › efficient visual recognition
efficient vision transformer inference
0.212024
Mixture of Nested Experts: Adaptive Processing of Visual Tokens · NeurIPS 2024

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

vision transformer · 0.8mixture of experts · 0.8
YearPublicationVenuePosition
2024 Mixture of Nested Experts: Adaptive Processing of Visual Tokens
abstract
The visual medium (images and videos) naturally contains a large amount of information redundancy, thereby providing a great opportunity for leveraging efficiency in processing. While Vision Transformer (ViT) based models scale effectively to large data regimes, they fail to capitalize on this inherent redundancy, leading to higher computational costs. Mixture of Experts (MoE) networks demonstrate scalability while maintaining same inference-time costs, but they come with a larger parameter footprint. We present Mixture of Nested Experts (MoNE), which utilizes a nested structure for experts, wherein individual experts fall on an increasing compute-accuracy curve. Given a compute budget, MoNE learns to dynamically choose tokens in a priority order, and thus redundant tokens are processed through cheaper nested experts. Using this framework, we achieve equivalent performance as the baseline models, while reducing inference time compute by over two-fold. We validate our approach on standard image and video datasets - ImageNet-21K, Kinetics400, and Something-Something-v2. We further highlight MoNE's adaptability by showcasing its ability to maintain strong performance across different inference-time compute budgets on videos, using only a single trained model.
Gagan Jain, Nidhi Hegde 0003, Aditya Kusupati, Arsha Nagrani, Shyamal Buch, Prateek Jain 0002, Anurag Arnab, Sujoy Paul
NeurIPS2