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

Vaggelis Dorovatas

dblp:399/5290 · also Evangelos Dorovatas · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—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
Efficient and distributed learning · 28% Vision and language · 28% Video understanding and tracking · 28%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.912025
Auto-Compressing Networks · NeurIPS 2025
Computer vision › Video understanding and tracking
streaming video understanding
0.912025
Recurrent Attention-based Token Selection for Efficient Streaming Video-LLMs · NeurIPS 2025
Machine learning › Efficient and distributed learning › token reduction
token selection
0.912025
Recurrent Attention-based Token Selection for Efficient Streaming Video-LLMs · NeurIPS 2025
Computer vision › Vision and language
video-language model
0.912025
Recurrent Attention-based Token Selection for Efficient Streaming Video-LLMs · NeurIPS 2025
Computer vision › Video understanding and tracking
video question answering
0.912025
Recurrent Attention-based Token Selection for Efficient Streaming Video-LLMs · NeurIPS 2025
Computer vision › Vision and language
visual token selection
0.912025
Recurrent Attention-based Token Selection for Efficient Streaming Video-LLMs · NeurIPS 2025
Natural language and speech › Language models and text generation
large language model
0.312025
Recurrent Attention-based Token Selection for Efficient Streaming Video-LLMs · NeurIPS 2025
Natural language and speech › Speech recognition and synthesis
noise robustness
0.312025
Auto-Compressing Networks · NeurIPS 2025
Machine learning › Trustworthy machine learning
robustness
0.312025
Auto-Compressing Networks · NeurIPS 2025

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

theoretical analysis · 0.9hierarchical token selection · 0.9gradient descent · 0.9caption-based question answering · 0.9attention-based selection · 0.9
YearPublicationVenuePosition
2025 Auto-Compressing Networks
abstract
Deep neural networks with short residual connections have demonstrated remarkable success across domains, but increasing depth often introduces computational redundancy without corresponding improvements in representation quality. We introduce Auto-Compressing Networks (ACNs), an architectural variant where additive long feedforward connections from each layer to the output replace traditional short residual connections. By analyzing the distinct dynamics induced by this modification, we reveal a unique property we coin as *auto-compression*—the ability of a network to organically compress information during training with gradient descent, through architectural design alone. Through auto-compression, information is dynamically "pushed" into early layers during training, enhancing their representational quality and revealing potential redundancy in deeper ones. We theoretically show that this property emerges from layer-wise training patterns found only in ACNs, where layers are dynamically utilized during training based on task requirements. We also find that ACNs exhibit enhanced noise robustness compared to residual networks, superior performance in low-data settings, improved transfer learning capabilities, and mitigate catastrophic forgetting suggesting that they learn representations that generalize better despite using fewer parameters. Our results demonstrate up to 18\% reduction in catastrophic forgetting and 30-80\% architectural compression while maintaining accuracy across vision transformers, MLP-mixers, and BERT architectures. These findings establish ACNs as a practical approach to developing efficient neural architectures that automatically adapt their computational footprint to task complexity, while learning robust representations suitable for noisy real-world tasks and continual learning scenarios.
Vaggelis Dorovatas, Georgios Paraskevopoulos, Alexandros Potamianos
NeurIPS1
2025 Recurrent Attention-based Token Selection for Efficient Streaming Video-LLMs
abstract
Video Large Language Models (Video-LLMs) excel at understanding videos in-context, assuming full access to the video when answering queries. However, these models face challenges in streaming scenarios where hour-long videos must be processed online, and questions need timely responses. In this work, we propose a training-free approach compatible with standard Video-LLMs, leveraging three key concepts: 1) LLM-informed selection of visual tokens to identify those that the LLM has attended to and contributed to its understanding of each short clip. Our attention-based selection allows us to discard up to ~95\% of unimportant visual tokens with minimal performance loss; 2) Hierarchical selection of tokens combined with natural language understanding of each processed clip; 3) Caption-based question answering for lightweight and accurate responses. Our method achieves state-of-the-art performance on streaming video benchmarks, striking a balance between efficiency and effectiveness.
Vaggelis Dorovatas, Soroush Seifi, Gunshi Gupta, Rahaf Aljundi
NeurIPS1