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.

Mano Bharathi M.

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

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 80% Language models and text generation · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
adaptive computation
1.012026
Adaptive Compute Efficient Learning via Conceptual-Criticality (Student Abstract) · AAAI 2026
Machine learning › Efficient and distributed learning › adaptive computation
adaptive inference
1.012026
Adaptive Compute Efficient Learning via Conceptual-Criticality (Student Abstract) · AAAI 2026
Natural language and speech › Language models and text generation
large language model inference
1.012026
Adaptive Compute Efficient Learning via Conceptual-Criticality (Student Abstract) · AAAI 2026
Machine learning › Efficient and distributed learning
model compression
1.012026
Adaptive Compute Efficient Learning via Conceptual-Criticality (Student Abstract) · AAAI 2026
Machine learning › Efficient and distributed learning › model compression
quantization
1.012026
Adaptive Compute Efficient Learning via Conceptual-Criticality (Student Abstract) · AAAI 2026

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

token pruning · 1.0quantization · 1.0layer skipping · 1.0
YearPublicationVenuePosition
2026 Adaptive Compute Efficient Learning via Conceptual-Criticality (Student Abstract)
abstract
The computational cost of large language models (LLMs) is a primary obstacle to sustainable deployment. Static resource allocation is inefficient, as not all inputs require the same depth of processing. We propose a framework for adaptive, compute-efficient learning via conceptual criticality, which dynamically tailors computation to the assessed difficulty of an input. A lightweight criticality prediction module es- timates conceptual complexity on a continuous scale, and this score governs the LLM’s inference pathway, selectively activating token pruning, layer skipping, and quantization. Simple inputs are processed with minimal FLOPs and la- tency, while complex inputs use the model’s full capacity to preserve accuracy. We benchmark our framework and in- troduce metrics to quantify sensitivity to input criticality and per-sample computational savings. Results demonstrate an improved accuracy-efficiency trade-off, paving the way for more resource-aware systems.
Iñigo Parra, Mano Bharathi M., Pushpa Kumar Balan, Priyadarsi Mishra
AAAI2