:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Huh, Joon Suk
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2602.07732
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning
por: Huh, Joon Suk, et al.
Publicado: (2024)

Efficient Discrepancy Testing for Learning with Distribution Shift
por: Chandrasekaran, Gautam, et al.
Publicado: (2024)

Subsampling Suffices for Adaptive Data Analysis
por: Blanc, Guy
Publicado: (2023)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
por: Awasthi, Pranjal, et al.
Publicado: (2025)

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees
por: Chandrasekaran, Gautam, et al.
Publicado: (2025)

Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
por: Mangoubi, Oren, et al.
Publicado: (2024)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
por: Wang, Jiachen T., et al.
Publicado: (2024)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
por: Zhang, Guangyi, et al.
Publicado: (2026)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
por: Axiotis, Kyriakos, et al.
Publicado: (2024)

Sample-Adaptivity Tradeoff in On-Demand Sampling
por: Haghtalab, Nika, et al.
Publicado: (2025)

Minimum Cost Adaptive Submodular Cover
por: Al-Thani, Hessa, et al.
Publicado: (2022)

Deletion Robust Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)

Fully Dynamic Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2023)

Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
por: Lyu, Xin, et al.
Publicado: (2024)

Testable Learning with Distribution Shift
por: Klivans, Adam R., et al.
Publicado: (2023)

Binary Search with Distributional Predictions
por: Dinitz, Michael, et al.
Publicado: (2024)

Optimal Approximate Matrix Multiplication over Sliding Windows
por: Yao, Ziqi, et al.
Publicado: (2025)

Better Bounds for the Distributed Experts Problem
por: Woodruff, David P., et al.
Publicado: (2026)

Distribution-Free Sequential Prediction with Abstentions
por: Yu, Jialin, et al.
Publicado: (2026)

Fitting trees to $\ell_1$-hyperbolic distances
por: Yim, Joon-Hyeok, et al.
Publicado: (2024)

Adaptive Power Iteration Method for Differentially Private PCA
por: Nguyen, Ta Duy, et al.
Publicado: (2026)

Retriever Portfolios: A Principled Approach to Adaptive RAG
por: Stouras, Miltiadis, et al.
Publicado: (2026)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
por: Rapoport, Emma, et al.
Publicado: (2025)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
por: Attia, Amit, et al.
Publicado: (2024)

Adaptive Local Clustering over Attributed Graphs
por: Zheng, Haoran, et al.
Publicado: (2025)

Ski Rental with Distributional Predictions of Unknown Quality
por: Cui, Qiming, et al.
Publicado: (2026)

Iterative Chow Filtering for Learning with Distribution Shift
por: Chandrasekaran, Gautam, et al.
Publicado: (2026)

PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses
por: Javanmard, Adel, et al.
Publicado: (2024)

Optimal Algorithms for Augmented Testing of Discrete Distributions
por: Aliakbarpour, Maryam, et al.
Publicado: (2024)

Distribution Learning Meets Graph Structure Sampling
por: Bhattacharyya, Arnab, et al.
Publicado: (2024)

Detection of Common Subtrees with Identical Label Distribution
por: Azaïs, Romain, et al.
Publicado: (2023)

Inner Product Aware Quantization: Provably Fast, Accurate, and Adaptive Algorithms
por: White, Nathan, et al.
Publicado: (2026)

Top-k on a Budget: Adaptive Ranking with Weak and Strong Oracles
por: Oettershagen, Lutz
Publicado: (2026)

Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
por: Aliakbarpour, Maryam, et al.
Publicado: (2026)

New Statistical and Computational Results for Learning Junta Distributions
por: Beretta, Lorenzo
Publicado: (2025)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
por: Chandrasekaran, Gautam, et al.
Publicado: (2025)

Efficient Calibration for Decision Making
por: Gopalan, Parikshit, et al.
Publicado: (2025)

Energy-Efficient Scheduling with Predictions
por: Balkanski, Eric, et al.
Publicado: (2024)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
por: Amanatidis, Georgios, et al.
Publicado: (2020)