:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Yang, Daniel
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2503.18999
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)

Near-Exponential Savings for Mean Estimation with Active Learning
by: Morimoto, Julian M., et al.
Published: (2025)

Near-Polynomially Competitive Active Logistic Regression
by: Zhou, Yihan, et al.
Published: (2025)

Near-optimal delta-convex estimation of Lipschitz functions
by: Balázs, Gábor
Published: (2025)

Near-optimal Per-Action Regret Bounds for Sleeping Bandits
by: Nguyen, Quan, et al.
Published: (2024)

Nearly Optimal Active Preference Learning and Its Application to LLM Alignment
by: Zhao, Yao, et al.
Published: (2026)

Towards minimax optimal algorithms for Active Simple Hypothesis Testing
by: Vijayan, Sushant
Published: (2025)

Near-optimal Swap Regret Minimization for Convex Losses
by: Hu, Lunjia, et al.
Published: (2026)

Near-optimal Rank Adaptive Inference of High Dimensional Matrices
by: Zheng, Frédéric, et al.
Published: (2025)

LASER: Learning Active Sensing for Continuum Field Reconstruction
by: Deng, Huayu, et al.
Published: (2026)

Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025)

A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces
by: Sinen, Tim
Published: (2026)

On Kernel Eigen-alignments of KRR: Reconstruction and Generalization
by: Liu, Yang, et al.
Published: (2026)

Near-optimal algorithms for private estimation and sequential testing of collision probability
by: Busa-Fekete, Robert, et al.
Published: (2025)

A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond
by: Hu, Zicheng, et al.
Published: (2025)

Near-optimal Linear Predictive Clustering in Non-separable Spaces via MIP and QPBO Reductions
by: Liang, Jiazhou, et al.
Published: (2025)

Antenna Near-Field Reconstruction from Far-Field Data Using Convolutional Neural Networks
by: Bagherkhani, Sahar, et al.
Published: (2025)

IMPACT: Importance-Aware Activation Space Reconstruction
by: Chowdhury, Md Mokarram, et al.
Published: (2025)

Active learning for efficient discovery of optimal gene combinations in the combinatorial perturbation space
by: Qin, Jason, et al.
Published: (2024)

Active and Passive Causal Inference Learning
by: Im, Daniel Jiwoong, et al.
Published: (2023)

Towards Achieving Near-optimal Utility for Privacy-Preserving Federated Learning via Data Generation and Parameter Distortion
by: Zhang, Xiaojin, et al.
Published: (2023)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
by: Chenakkod, Shabarish, et al.
Published: (2024)

Tokenized SAEs: Disentangling SAE Reconstructions
by: Dooms, Thomas, et al.
Published: (2025)

Active Flow Matching
by: Grewal, Yashvir S., et al.
Published: (2026)

Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation
by: Ding, Shihong, et al.
Published: (2026)

Distribution Guided Active Feature Acquisition
by: Li, Yang, et al.
Published: (2024)

A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2025)

Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization
by: Maier, Severin, et al.
Published: (2023)

Generative Algorithms for Wildfire Progression Reconstruction from Multi-Modal Satellite Active Fire Measurements and Terrain Height
by: Shaddy, Bryan, et al.
Published: (2025)

Near-Future Policy Optimization
by: Qin, Chuanyu, et al.
Published: (2026)

Active learning for energy-based antibody optimization and enhanced screening
by: Furui, Kairi, et al.
Published: (2024)

CLEAR-IR: Clarity-Enhanced Active Reconstruction of Infrared Imagery
by: Shankar, Nathan, et al.
Published: (2025)

Learning to Detect Language Model Training Data via Active Reconstruction
by: Yin, Junjie Oscar, et al.
Published: (2026)

Near-Optimal Sample Complexity for Online Constrained MDPs
by: Liu, Chang, et al.
Published: (2026)

Nearly Optimal Subdata Selection
by: Yang, Min, et al.
Published: (2026)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
by: Amanatidis, Georgios, et al.
Published: (2021)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
by: Zandieh, Amir, et al.
Published: (2025)

Amortized Active Generation of Pareto Sets
by: Steinberg, Daniel M., et al.
Published: (2025)

Simple and near-optimal algorithms for hidden stratification and multi-group learning
by: Tosh, Christopher, et al.
Published: (2021)

GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation
by: Zhang, Shihao, et al.
Published: (2026)