:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Tosi, Mauro Dalle Lucca, Theobald, Martin
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2305.11942
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximation Algorithms for D-optimal Design
por: Singh, Mohit, et al.
Publicado: (2018)

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

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)

Unrolled denoising networks provably learn optimal Bayesian inference
por: Karan, Aayush, et al.
Publicado: (2024)

Agnostic learning in (almost) optimal time via Gaussian surface area
por: Pesenti, Lucas, et al.
Publicado: (2026)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
por: He, Xi, et al.
Publicado: (2023)

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

Polynomial-time derivation of optimal k-tree topology from Markov networks
por: Dastjerdi, Fereshteh R., et al.
Publicado: (2024)

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

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
por: Qin, Hao, et al.
Publicado: (2025)

Combinatorial optimization of the coefficient of determination
por: Harary, Marc
Publicado: (2024)

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
por: He, Xi, et al.
Publicado: (2025)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
por: Assadi, Sepehr, et al.
Publicado: (2023)

Fast Partition-Based Cross-Validation With Centering and Scaling for $\mathbf{X}^\mathbf{T}\mathbf{X}$ and $\mathbf{X}^\mathbf{T}\mathbf{Y}$
por: Engstrøm, Ole-Christian Galbo, et al.
Publicado: (2024)

A Broader View on Clustering under Cluster-Aware Norm Objectives
por: Herold, Martin G., et al.
Publicado: (2025)

Clustering to Minimize Cluster-Aware Norm Objectives
por: Herold, Martin G., et al.
Publicado: (2024)

TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
por: Hines, Christian L., et al.
Publicado: (2025)

The SMART approach to instance-optimal online learning
por: Banerjee, Siddhartha, et al.
Publicado: (2024)

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

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

Rate-optimal community detection near the KS threshold via node-robust algorithms
por: Ding, Jingqiu, et al.
Publicado: (2025)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
por: Chenakkod, Shabarish, et al.
Publicado: (2024)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
por: Shakiba, Ali
Publicado: (2023)

Value-Compressed Sparse Column (VCSC): Sparse Matrix Storage for Redundant Data
por: Ruiter, Skyler, et al.
Publicado: (2023)

Replicable Clustering
por: Esfandiari, Hossein, et al.
Publicado: (2023)

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

Optimal Clustering with Dependent Costs in Bayesian Networks
por: Wu, Paul Pao-Yen, et al.
Publicado: (2023)

Connectivity Oracles for Predictable Vertex Failures
por: Hu, Bingbing, et al.
Publicado: (2023)

On Computing Optimal Tree Ensembles
por: Komusiewicz, Christian, et al.
Publicado: (2023)

Learning the Positions in CountSketch
por: Li, Yi, et al.
Publicado: (2023)

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

Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
por: Roy, Shubhajit, et al.
Publicado: (2023)

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

Adversarial Attacks on Combinatorial Multi-Armed Bandits
por: Balasubramanian, Rishab, et al.
Publicado: (2023)

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

Sharper Bounds for $\ell_p$ Sensitivity Sampling
por: Woodruff, David P., et al.
Publicado: (2023)

Adversarial Resilience in Sequential Prediction via Abstention
por: Goel, Surbhi, et al.
Publicado: (2023)

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