:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dastjerdi, Fereshteh R., Cai, Liming
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	https://arxiv.org/abs/2404.05991
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
par: He, Xi, et autres
Publié: (2025)

Unrolled denoising networks provably learn optimal Bayesian inference
par: Karan, Aayush, et autres
Publié: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
par: Greenhut, Daniel, et autres
Publié: (2025)

Outlier Robust Multivariate Polynomial Regression
par: Arora, Vipul, et autres
Publié: (2024)

Testably Learning Polynomial Threshold Functions
par: Slot, Lucas, et autres
Publié: (2024)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Agnostic learning in (almost) optimal time via Gaussian surface area
par: Pesenti, Lucas, et autres
Publié: (2026)

Learning Juntas under Markov Random Fields
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time
par: McMahan, Jeremy
Publié: (2024)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
par: Pham, Ninh, et autres
Publié: (2025)

Learning Augmented Graph $k$-Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

A Faster $k$-means++ Algorithm
par: Liang, Jiehao, et autres
Publié: (2022)

Incremental (k, z)-Clustering on Graphs
par: Cruciani, Emilio, et autres
Publié: (2026)

Dynamic algorithms for k-center on graphs
par: Cruciani, Emilio, et autres
Publié: (2023)

Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
par: Gaitonde, Jason, et autres
Publié: (2024)

Average Sensitivity of Hierarchical $k$-Median Clustering
par: Li, Shijie, et autres
Publié: (2025)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
par: Alman, Josh, et autres
Publié: (2025)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
par: Song, Shihong, et autres
Publié: (2024)

Experimental Design Using Interlacing Polynomials
par: Lau, Lap Chi, et autres
Publié: (2024)

Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
par: Zeng, Shiwei, et autres
Publié: (2023)

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
par: Forster, Sebastian, et autres
Publié: (2024)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
par: Nie, Guanyu, et autres
Publié: (2024)

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
par: Zhu, Yanhui, et autres
Publié: (2024)

Generalized Top-k Mallows Model for Ranked Choices
par: Haddadan, Shahrzad, et autres
Publié: (2025)

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

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
par: Drexler, Lukas, et autres
Publié: (2023)

Metric $k$-clustering using only Weak Comparison Oracles
par: Raychaudhury, Rahul, et autres
Publié: (2026)

Learning-Augmented Algorithms for $k$-median via Online Learning
par: Hebbar, Anish, et autres
Publié: (2026)

Graph neural networks extrapolate out-of-distribution for shortest paths
par: Nerem, Robert R., et autres
Publié: (2025)

$k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers
par: Haris, Themistoklis
Publié: (2024)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
par: Maity, Binita, et autres
Publié: (2024)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
par: Zhang, Guangyi, et autres
Publié: (2026)

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

Dynamic Algorithm for Explainable k-medians Clustering under lp Norm
par: Makarychev, Konstantin, et autres
Publié: (2025)

Approximation Algorithms for D-optimal Design
par: Singh, Mohit, et autres
Publié: (2018)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
par: Gayen, Sutanu, et autres
Publié: (2024)

Approximating splits for decision trees quickly in sparse data streams
par: Tatti, Nikolaj
Publié: (2026)

OPTWIN: Drift identification with optimal sub-windows
par: Tosi, Mauro Dalle Lucca, et autres
Publié: (2023)