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

Thomas Merth

dblp:324/8817 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 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 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
Language models and text generation · 47% Efficient and distributed learning · 36% Deep learning architectures and training · 18%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › large language model inference
long-context inference
0.812024
Superposition Prompting: Improving and Accelerating Retrieval-Augmented Generation · ICML 2024
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.812024
Superposition Prompting: Improving and Accelerating Retrieval-Augmented Generation · ICML 2024
Machine learning › Efficient and distributed learning
model compression
0.612022
SPIN: An Empirical Evaluation on Sharing Parameters of Isotropic Networks · ECCV (11) 2022
Machine learning › Efficient and distributed learning
parameter sharing
0.612022
SPIN: An Empirical Evaluation on Sharing Parameters of Isotropic Networks · ECCV (11) 2022
Information retrieval › ranking › search relevance › relevance modeling
contextual relevance
0.212024
Superposition Prompting: Improving and Accelerating Retrieval-Augmented Generation · ICML 2024
Information retrieval
retrieval-augmented generation
0.212024
Superposition Prompting: Improving and Accelerating Retrieval-Augmented Generation · ICML 2024

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

superposition prompting · 1.5parallel prompt paths · 1.5empirical evaluation · 0.6
YearPublicationVenuePosition
2024 Superposition Prompting: Improving and Accelerating Retrieval-Augmented Generation
abstract
Despite the successes of large language models (LLMs), they exhibit significant drawbacks, particularly when processing long contexts. Their inference cost scales quadratically with respect to sequence length, making it expensive for deployment in some real-world text processing applications, such as retrieval-augmented generation (RAG). Additionally, LLMs also exhibit the "distraction phenomenon", where irrelevant context in the prompt degrades output quality. To address these drawbacks, we propose a novel RAG prompting methodology, superposition prompting, which can be directly applied to pre-trained transformer-based LLMs without the need for fine-tuning. At a high level, superposition prompting allows the LLM to process input documents in parallel prompt paths, discarding paths once they are deemed irrelevant. We demonstrate the capability of our method to simultaneously enhance time efficiency across a variety of question-answering benchmarks using multiple pre-trained LLMs. Furthermore, our technique significantly improves accuracy when the retrieved context is large relative the context the model was trained on. For example, our approach facilitates a $93\times$ reduction in compute time while improving accuracy by $43%$ on the NaturalQuestions-Open dataset with the MPT-7B instruction-tuned model over naive RAG.
Thomas Merth, Qichen Fu, Mohammad Rastegari, Mahyar Najibi
ICML1
2024 FastSR-NeRF: Improving NeRF Efficiency on Consumer Devices with A Simple Super-Resolution Pipeline
abstract
Super-resolution (SR) techniques have recently been proposed to upscale the outputs of neural radiance fields (NeRF) and generate high-quality images with enhanced inference speeds. However, existing NeRF+SR methods increase training overhead by using extra input features, loss functions, and/or expensive training procedures such as knowledge distillation. In this paper, we aim to leverage SR for efficiency gains without costly training or architectural changes. Specifically, we build a simple NeRF+SR pipeline that directly combines existing modules, and we propose a lightweight augmentation technique, random patch sampling, for training. Compared to existing NeRF+SR methods, our pipeline mitigates the SR computing overhead and can be trained up to 23× faster, making it feasible to run on consumer devices such as the Apple MacBook. Experiments show our pipeline can upscale NeRF outputs by 2-4× while maintaining high quality, increasing inference speeds by up to 18× on an NVIDIA V100 GPU and 12.8× on an M1 Pro chip. We conclude that SR can be a simple but effective technique for improving the efficiency of NeRF models for consumer devices.
Chien-Yu Lin, Qichen Fu, Thomas Merth, Karren D. Yang, Anurag Ranjan
WACV3
2022 SPIN: An Empirical Evaluation on Sharing Parameters of Isotropic Networks
Chien-Yu Lin, Anish Prabhu, Thomas Merth, Sachin Mehta, Anurag Ranjan, Maxwell Horton, Mohammad Rastegari
ECCV (11)3