:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Purohit, Kiran, V, Venktesh, Devalla, Raghuram, Yerragorla, Krishna Mohan, Bhattacharya, Sourangshu, Anand, Avishek
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2411.03877
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sample Efficient Demonstration Selection for In-Context Learning
by: Purohit, Kiran, et al.
Published: (2025)

A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNs
by: Purohit, Kiran, et al.
Published: (2024)

A Data-Driven Defense against Edge-case Model Poisoning Attacks on Federated Learning
by: Purohit, Kiran, et al.
Published: (2023)

Test-time Corpus Feedback: From Retrieval to RAG
by: Rathee, Mandeep, et al.
Published: (2025)

VTruST: Controllable value function based subset selection for Data-Centric Trustworthy AI
by: Das, Soumi, et al.
Published: (2024)

SUNAR: Semantic Uncertainty based Neighborhood Aware Retrieval for Complex QA
by: Venktesh, V, et al.
Published: (2025)

DEXTER: A Benchmark for open-domain Complex Question Answering using LLMs
by: Prabhu, Venktesh V. Deepali, et al.
Published: (2024)

Challenger-Based Combinatorial Bandits for Subcarrier Selection in OFDM Systems
by: Amiri, Mohsen, et al.
Published: (2025)

Local Feature Selection without Label or Feature Leakage for Interpretable Machine Learning Predictions
by: Oosterhuis, Harrie, et al.
Published: (2024)

On Higher-Order Geometric Refinements of Classical Covariance Asymptotics: An Approach via Intrinsic and Extrinsic Information Geometry
by: Amir, Malik, et al.
Published: (2026)

A Benchmark for Open-Domain Numerical Fact-Checking Enhanced by Claim Decomposition
by: Venktesh, V, et al.
Published: (2025)

When More Reformulations Hurt: Avoiding Drift using Ranker Feedback
by: Venktesh, V, et al.
Published: (2026)

Trust but Verify! A Survey on Verification Design for Test-time Scaling
by: Venktesh, V, et al.
Published: (2025)

Reproducing Adaptive Reranking for Reasoning-Intensive IR
by: Rathee, Mandeep, et al.
Published: (2026)

Forward versus Backward: Comparing Reasoning Objectives in Direct Preference Optimization
by: Nikzad, Murtaza, et al.
Published: (2026)

The Surprising Effectiveness of Rankers Trained on Expanded Queries
by: Anand, Abhijit, et al.
Published: (2024)

QuanTemp: A real-world open-domain benchmark for fact-checking numerical claims
by: V, Venktesh, et al.
Published: (2024)

Understanding the User: An Intent-Based Ranking Dataset
by: Anand, Abhijit, et al.
Published: (2024)

Leveraging Data Symmetries to Select an Optimal Subset of Training Data under Label Noise
by: Shubham, Kumar, et al.
Published: (2026)

Fair Column Subset Selection
by: Matakos, Antonis, et al.
Published: (2023)

Prompt Optimization with EASE? Efficient Ordering-aware Automated Selection of Exemplars
by: Wu, Zhaoxuan, et al.
Published: (2024)

Minimax and Communication-Efficient Distributed Best Subset Selection with Oracle Property
by: Lan, Jingguo, et al.
Published: (2024)

Evaluating List Construction and Temporal Understanding capabilities of Large Language Models
by: Dumitru, Alexandru, et al.
Published: (2025)

Think Right, Not More: Test-Time Scaling for Numerical Claim Verification
by: Chungkham, Primakov, et al.
Published: (2025)

Enhancing Offline Reinforcement Learning with Curriculum Learning-Based Trajectory Valuation
by: Abolfazli, Amir, et al.
Published: (2025)

Scales++: Compute Efficient Evaluation Subset Selection with Cognitive Scales Embeddings
by: Bean, Andrew M., et al.
Published: (2025)

Dynamic Incremental Optimization for Best Subset Selection
by: Ren, Shaogang, et al.
Published: (2024)

MUSS: Multilevel Subset Selection for Relevance and Diversity
by: Nguyen, Vu, et al.
Published: (2025)

Efficient Data Subset Selection to Generalize Training Across Models: Transductive and Inductive Networks
by: Jain, Eeshaan, et al.
Published: (2024)

Most Influential Subset Selection: Challenges, Promises, and Beyond
by: Hu, Yuzheng, et al.
Published: (2024)

Breaking the Lens of the Telescope: Online Relevance Estimation over Large Retrieval Sets
by: Rathee, Mandeep, et al.
Published: (2025)

Generalisation in Multitask Fitted Q-Iteration and Offline Q-learning
by: Manda, Kausthubh, et al.
Published: (2025)

A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval
by: Barik, Adarsh, et al.
Published: (2024)

Data Efficient Subset Training with Differential Privacy
by: Gandhi, Ninad Jayesh, et al.
Published: (2025)

Scalable Subset Selection in Linear Mixed Models
by: Thompson, Ryan, et al.
Published: (2025)

DataS^3: Dataset Subset Selection for Specialization
by: Hulkund, Neha, et al.
Published: (2025)

Overcoming Catastrophic Forgetting by Exemplar Selection in Task-oriented Dialogue System
by: Chen, Chen, et al.
Published: (2024)

Exemplar Partitioning for Mechanistic Interpretability
by: Rumbelow, Jessica
Published: (2026)

Subset Selection for Stratified Sampling in Online Controlled Experiments
by: Momozu, Haru, et al.
Published: (2025)

What Makes a Good Example? Modeling Exemplar Selection with Neural Network Representations
by: Qiu, Fanxiao Wani, et al.
Published: (2026)