Copertina

PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Javanmard, Adel, Fahrbach, Matthew, Mirrokni, Vahab
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Approximately Optimal Core Shapes for Tensor Decompositions
di: Ghadiri, Mehrdad, et al.
Pubblicazione: (2023)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
di: Epasto, Alessandro, et al.
Pubblicazione: (2020)

Replicable Clustering
di: Esfandiari, Hossein, et al.
Pubblicazione: (2023)

SubGen: Token Generation in Sublinear Time and Memory
di: Zandieh, Amir, et al.
Pubblicazione: (2024)

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

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

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
di: Fahrbach, Matthew, et al.
Pubblicazione: (2025)

Accelerated Relax-and-Round for Concave Coverage Problems
di: Fahrbach, Matthew, et al.
Pubblicazione: (2026)

Weak to Strong Learning from Aggregate Labels
di: Makhija, Yukti, et al.
Pubblicazione: (2024)

Procurement Auctions via Approximately Optimal Submodular Optimization
di: Deng, Yuan, et al.
Pubblicazione: (2024)

Faster Graph Embeddings via Coarsening
di: Fahrbach, Matthew, et al.
Pubblicazione: (2020)

High-Dimensional Geometric Streaming for Nearly Low Rank Data
di: Esfandiari, Hossein, et al.
Pubblicazione: (2024)

Optimal Communication for Classic Functions in the Coordinator Model and Beyond
di: Esfandiari, Hossein, et al.
Pubblicazione: (2024)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
di: Fahrbach, Matthew, et al.
Pubblicazione: (2024)

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

Massively Parallel Minimum Spanning Tree in General Metric Spaces
di: Azarmehr, Amir, et al.
Pubblicazione: (2024)

Better Models and Algorithms for Learning Ising Models from Dynamics
di: Gaitonde, Jason, et al.
Pubblicazione: (2025)

The Cost of Parallelizing Boosting
di: Lyu, Xin, et al.
Pubblicazione: (2024)

Learning-Augmented Algorithms with Explicit Predictors
di: Elias, Marek, et al.
Pubblicazione: (2024)

Testing Noise Assumptions of Learning Algorithms
di: Goel, Surbhi, et al.
Pubblicazione: (2025)

Algorithms with Calibrated Machine Learning Predictions
di: Shen, Judy Hanwen, et al.
Pubblicazione: (2025)

Perturb-and-Project: Differentially Private Similarities and Marginals
di: Cohen-Addad, Vincent, et al.
Pubblicazione: (2024)

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

Learning-Augmented Algorithms for $k$-median via Online Learning
di: Hebbar, Anish, et al.
Pubblicazione: (2026)

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
di: Goel, Surbhi, et al.
Pubblicazione: (2024)

Learning-Augmented Streaming Algorithms for Correlation Clustering
di: Dong, Yinhao, et al.
Pubblicazione: (2025)

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

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Lower Bounds for the Algorithmic Complexity of Learned Indexes
di: Croquevielle, Luis Alberto, et al.
Pubblicazione: (2026)

Prediction-Specific Design of Learning-Augmented Algorithms
di: Li, Sizhe, et al.
Pubblicazione: (2025)

Scalable Learning of Item Response Theory Models
di: Frick, Susanne, et al.
Pubblicazione: (2024)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
di: Angelopoulos, Spyros, et al.
Pubblicazione: (2024)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
di: Angelopoulos, Spyros, et al.
Pubblicazione: (2025)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
di: Lechowicz, Adam, et al.
Pubblicazione: (2023)

Fast Tensor Completion via Approximate Richardson Iteration
di: Ghadiri, Mehrdad, et al.
Pubblicazione: (2025)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
di: Zhang, Keyuan, et al.
Pubblicazione: (2024)

Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management
di: Hsieh, Wen-Han, et al.
Pubblicazione: (2026)

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

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
di: Klivans, Adam R., et al.
Pubblicazione: (2024)

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
di: Veldt, Nate, et al.
Pubblicazione: (2026)