Demo Data from SIGIR 2026 / reviewers in the wild / expert
Harshavardhan Adepu
dblp:372/1508
· DBLP profile ↗
2ranked-venue papers
1as 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 · 1 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 · 60% 3D vision · 20% Deep learning architectures and training · 20% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
implicit neural representation |
0.8 | 1 | 2024 | Implicit Representations via Operator Learning · ICML 2024 |
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | FrameQuant: Flexible Low-Bit Quantization for Transformers · ICML 2024 |
Machine learning › Deep learning architectures and training
operator learning |
0.8 | 1 | 2024 | Implicit Representations via Operator Learning · ICML 2024 |
Machine learning › Efficient and distributed learning › model compression › quantization
post-training quantization |
0.8 | 1 | 2024 | FrameQuant: Flexible Low-Bit Quantization for Transformers · ICML 2024 |
Machine learning › Efficient and distributed learning › model compression
quantization |
0.8 | 1 | 2024 | FrameQuant: Flexible Low-Bit Quantization for Transformers · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
multi-layer perceptron · 0.8integral transform · 0.8harmonic analysis · 0.8fusion frames · 0.8denoising filter · 0.8convolution · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | FrameQuant: Flexible Low-Bit Quantization for TransformersabstractTransformers are the backbone of powerful foundation models for many Vision and Natural Language Processing tasks. But their compute and memory/storage footprint is large, and so, serving such models is expensive often requiring high-end hardware. To mitigate this difficulty, Post-Training Quantization seeks to modify a pre-trained model and quantize it to eight bits or lower, significantly boosting compute/memory/latency efficiency. Such models have been successfully quantized to four bits with some performance loss. In this work, we outline a simple scheme to quantize Transformer-based models to just two bits (plus some overhead) with only a small drop in accuracy. Key to our formulation is a concept borrowed from Harmonic analysis called Fusion Frames. Our main finding is that the quantization must take place not in the original weight space, but instead in the Fusion Frame representations. If quantization is interpreted as the addition of noise, our casting of the problem allows invoking an extensive body of known consistent recovery and noise robustness guarantees. Further, if desired, de-noising filters are known in closed form. We show empirically, via a variety of experiments, that (almost) two-bit quantization for Transformer models promises sizable efficiency gains. The code is available at https://github.com/vsingh-group/FrameQuant Harshavardhan Adepu, Zhanpeng Zeng |
ICML | 1 |
| 2024 | Implicit Representations via Operator LearningabstractThe idea of representing a signal as the weights of a neural network, called *Implicit Neural Representations* (INRs), has led to exciting implications for compression, view synthesis and 3D volumetric data understanding. One problem in this setting pertains to the use of INRs for downstream processing tasks. Despite some conceptual results, this remains challenging because the INR for a given image/signal often exists in isolation. What does the neighborhood around a given INR correspond to? Based on this question, we offer an operator theoretic reformulation of the INR model, which we call Operator INR (or O-INR). At a high level, instead of mapping positional encodings to a signal, O-INR maps one function space to another function space. A practical form of this general casting is obtained by appealing to Integral Transforms. The resultant model does not need multi-layer perceptrons (MLPs), used in most existing INR models -- we show that convolutions are sufficient and offer benefits including numerically stable behavior. We show that O-INR can easily handle most problem settings in the literature, and offers a similar performance profile as baselines. These benefits come with minimal, if any, compromise. Our code is available at https://github.com/vsingh-group/oinr. Sourav Pal, Harshavardhan Adepu, Clinton J. Wang, Polina Golland |
ICML | 2 |