Cover Image

Agnostic Active Learning of Single Index Models with Linear Sample Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gajjar, Aarshvi, Tai, Wai Ming, Xu, Xingyu, Hegde, Chinmay, Li, Yi, Musco, Christopher
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-optimal Active Regression of Single-Index Models
by: Li, Yi, et al.
Published: (2025)

Improved Active Learning via Dependent Leverage Score Sampling
by: Shimizu, Atsushi, et al.
Published: (2023)

Query Efficient Structured Matrix Learning
by: Amsel, Noah, et al.
Published: (2025)

WILDCHAT-50M: A Deep Dive Into the Role of Synthetic Data in Post-Training
by: Feuer, Benjamin, et al.
Published: (2025)

Provably Accurate Shapley Value Estimation via Leverage Score Sampling
by: Musco, Christopher, et al.
Published: (2024)

On the Sample Complexity of Differentially Private Policy Optimization
by: He, Yi, et al.
Published: (2025)

Matrix Product Sketching via Coordinated Sampling
by: Daliri, Majid, et al.
Published: (2025)

Exploring the Agentic Frontier of Verilog Code Generation
by: Yubeaton, Patrick, et al.
Published: (2026)

Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity
by: Li, Bo, et al.
Published: (2025)

Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models
by: Wang, Puqian, et al.
Published: (2024)

SolidMark: Evaluating Image Memorization in Generative Models
by: Kriplani, Nicky, et al.
Published: (2025)

Learning to Solve Related Linear Systems
by: Hegde, Disha, et al.
Published: (2025)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
by: Dereziński, Michał, et al.
Published: (2024)

MARVIS: Modality Adaptive Reasoning over VISualizations
by: Feuer, Benjamin, et al.
Published: (2025)

Benchmarking Estimators for Natural Experiments: A Novel Dataset and a Doubly Robust Algorithm
by: Witter, R. Teal, et al.
Published: (2024)

Sharper Bounds for Chebyshev Moment Matching, with Applications
by: Musco, Cameron, et al.
Published: (2024)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
by: Sherman, Uri, et al.
Published: (2025)

Full-Batch Gradient Descent Outperforms One-Pass SGD: Sample Complexity Separation in Single-Index Learning
by: Kovačević, Filip, et al.
Published: (2026)

Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
by: Kang, Yue, et al.
Published: (2025)

Discovering Sparse Recovery Algorithms Using Neural Architecture Search
by: Yubeaton, Patrick, et al.
Published: (2025)

The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models
by: Damian, Alex, et al.
Published: (2025)

Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
by: Cohen, Alon, et al.
Published: (2025)

Geometry Matters: Benchmarking Scientific ML Approaches for Flow Prediction around Complex Geometries
by: Rabeh, Ali, et al.
Published: (2024)

RLS3: RL-Based Synthetic Sample Selection to Enhance Spatial Reasoning in Vision-Language Models for Indoor Autonomous Perception
by: Waite, Joshua R., et al.
Published: (2025)

One-shot Active Learning Based on Lewis Weight Sampling for Multiple Deep Models
by: Huang, Sheng-Jun, et al.
Published: (2024)

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning
by: Attias, Idan, et al.
Published: (2026)

A Competitive Algorithm for Agnostic Active Learning
by: Price, Eric, et al.
Published: (2023)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
by: Diwan, Haya, et al.
Published: (2024)

Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
by: Jiao, Yuchen, et al.
Published: (2026)

Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
by: Liu, Xingtu, et al.
Published: (2025)

Sample Complexity Characterization for Linear Contextual MDPs
by: Deng, Junze, et al.
Published: (2024)

An Expanded Benchmark that Rediscovers and Affirms the Edge of Uncertainty Sampling for Active Learning in Tabular Datasets
by: Lu, Po-Yi, et al.
Published: (2023)

Optimal estimation of Gaussian (poly)trees
by: Wang, Yuhao, et al.
Published: (2024)

LLM-AUG: Robust Wireless Data Augmentation with In-Context Learning in Large Language Models
by: Gajjar, Pranshav, et al.
Published: (2026)

PolySHAP: Extending KernelSHAP with Interaction-Informed Polynomial Regression
by: Fumagalli, Fabian, et al.
Published: (2026)

Regression-adjusted Monte Carlo Estimators for Shapley Values and Probabilistic Values
by: Witter, R. Teal, et al.
Published: (2025)

Active Learning for Stochastic Contextual Linear Bandits
by: Brunskill, Emma, et al.
Published: (2026)

ReLU Neural Networks with Linear Layers are Biased Towards Single- and Multi-Index Models
by: Parkinson, Suzanna, et al.
Published: (2023)

DeCAF: Decentralized Consensus-And-Factorization for Low-Rank Adaptation of Foundation Models
by: Saadati, Nastaran, et al.
Published: (2025)

Neural Network-based Partial-Linear Single-Index Models for Environmental Mixtures Analysis
by: Do, Hyungrok, et al.
Published: (2025)