Imagen de Portada

Optimal Algorithms for Augmented Testing of Discrete Distributions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aliakbarpour, Maryam, Indyk, Piotr, Rubinfeld, Ronitt, Silwal, Sandeep
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Better Private Distribution Testing by Leveraging Unverified Auxiliary Data
por: Aliakbarpour, Maryam, et al.
Publicado: (2025)

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

A Bi-metric Framework for Fast Similarity Search
por: Xu, Haike, et al.
Publicado: (2024)

How fast can you find a good hypothesis?
por: Aamand, Anders, et al.
Publicado: (2025)

On the Structure of Replicable Hypothesis Testers
por: Aamand, Anders, et al.
Publicado: (2025)

Quality control in sublinear time: a case study via random graphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Statistical-Computational Trade-offs for Density Estimation
por: Aamand, Anders, et al.
Publicado: (2024)

Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
por: Indyk, Piotr, et al.
Publicado: (2025)

Stochastic Matching via In-n-Out Local Computation Algorithms
por: Azarmehr, Amir, et al.
Publicado: (2024)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
por: Mitrović, Slobodan, et al.
Publicado: (2026)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
por: Eden, Talya, et al.
Publicado: (2025)

Locally computing edge orientations
por: Mitrović, Slobodan, et al.
Publicado: (2025)

Learning-Augmented Frequent Directions
por: Aamand, Anders, et al.
Publicado: (2025)

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
por: Eden, Talya, et al.
Publicado: (2025)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
por: Silwal, Sandeep, et al.
Publicado: (2025)

No Price Tags? No Problem: Query Strategies for Unpriced Information
por: Nadimpalli, Shivam, et al.
Publicado: (2025)

Provable Quantization with Randomized Hadamard Transform
por: Feng, Ying, et al.
Publicado: (2026)

Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
por: Aliakbarpour, Maryam, et al.
Publicado: (2025)

Even Faster Algorithm for the Chamfer Distance
por: Feng, Ying, et al.
Publicado: (2025)

Metalearning with Very Few Samples Per Task
por: Aliakbarpour, Maryam, et al.
Publicado: (2023)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
por: Chatziafratis, Vaggos, et al.
Publicado: (2023)

High-Probability Bounds For Heterogeneous Local Differential Privacy
por: Aliakbarpour, Maryam, et al.
Publicado: (2025)

Improved Approximations for Hard Graph Problems using Predictions
por: Aamand, Anders, et al.
Publicado: (2025)

Beyond Worst Case Local Computation Algorithms
por: Biswas, Amartya Shankha, et al.
Publicado: (2024)

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

Learning-Augmented Ski Rental with Discrete Distributions: A Bayesian Approach
por: Kang, Bosun, et al.
Publicado: (2025)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
por: Gao, Jie, et al.
Publicado: (2025)

Efficiently Computing Similarities to Private Datasets
por: Backurs, Arturs, et al.
Publicado: (2024)

A Fast Coloring Oracle for Average Case Hypergraphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Near-Optimal Algorithms for Omniprediction
por: Okoroafor, Princewill, et al.
Publicado: (2025)

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

Dimension Reduction for Clustering: The Curious Case of Discrete Centers
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Towards Optimal Robustness in Learning-Augmented Paging
por: Chen, Peng, et al.
Publicado: (2026)

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

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

Instance-Optimal Uniformity Testing and Tracking
por: Blanc, Guy, et al.
Publicado: (2025)

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

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

A Simple Approximation Algorithm for Optimal Decision Tree
por: Zhuo, Zhengjia, et al.
Publicado: (2025)

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