:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Singh, Mohit, Xie, Weijun
Formato:	Preprint
Publicado:	2018
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/1802.08372
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computing Experiment-Constrained D-Optimal Designs
por: Pillai, Aditya, et al.
Publicado: (2024)

Approximation Algorithms for Combinatorial Optimization with Predictions
por: Antoniadis, Antonios, et al.
Publicado: (2024)

An Approximation Algorithm for Graph Label Selection
por: John, Josia, et al.
Publicado: (2026)

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

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
por: Hayderi, Alexandre, et al.
Publicado: (2024)

Incremental Approximate Single-Source Shortest Paths with Predictions
por: McCauley, Samuel, et al.
Publicado: (2025)

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

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
por: Lee, Russell, et al.
Publicado: (2022)

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

Exact and Approximate Algorithms for Polytree Learning
por: Harviainen, Juha, et al.
Publicado: (2026)

Sublinear Time Quantum Algorithm for Attention Approximation
por: Song, Zhao, et al.
Publicado: (2026)

Guessing Efficiently for Constrained Subspace Approximation
por: Bhaskara, Aditya, et al.
Publicado: (2025)

The Space Complexity of Approximating Logistic Loss
por: Dexter, Gregory, et al.
Publicado: (2024)

Dynamic Spectral Clustering with Provable Approximation Guarantee
por: Laenen, Steinar, et al.
Publicado: (2024)

Reweighted Solutions for Weighted Low Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2024)

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

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

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

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
por: Pham, Ninh, et al.
Publicado: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
por: Veldt, Nate, et al.
Publicado: (2025)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
por: Gayen, Sutanu, et al.
Publicado: (2024)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
por: Danait, Ved, et al.
Publicado: (2025)

Approximating splits for decision trees quickly in sparse data streams
por: Tatti, Nikolaj
Publicado: (2026)

On Socially Fair Low-Rank Approximation and Column Subset Selection
por: Song, Zhao, et al.
Publicado: (2024)

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
por: Drexler, Lukas, et al.
Publicado: (2023)

A Faster Generalized Two-Stage Approximate Top-K
por: Samaga, Yashas, et al.
Publicado: (2025)

Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
por: Woodruff, David P., et al.
Publicado: (2024)

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

OPTWIN: Drift identification with optimal sub-windows
por: Tosi, Mauro Dalle Lucca, et al.
Publicado: (2023)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
por: Blum, Avrim, et al.
Publicado: (2024)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2024)

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
por: Beretta, Lorenzo, et al.
Publicado: (2025)

Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases
por: Wolfson, Daniel, et al.
Publicado: (2026)

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

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

MNL-Bandit with Knapsacks: a near-optimal algorithm
por: Aznag, Abdellah, et al.
Publicado: (2021)

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

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
por: He, Xi
Publicado: (2025)

A Faster $k$-means++ Algorithm
por: Liang, Jiehao, et al.
Publicado: (2022)

Efficient and Provable Algorithms for Covariate Shift
por: Adil, Deeksha, et al.
Publicado: (2025)