Imagen de Portada

A Note on Non-Negative $L_1$-Approximating Polynomials

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lee, Jane H., Mehrotra, Anay, Zampetakis, Manolis
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Data Structures and Algorithms Statistics Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
por: Lee, Jane H., et al.
Publicado: (2024)

Smoothed Analysis of Learning from Positive Samples
por: Lee, Jane H., et al.
Publicado: (2025)

What is Learnable in Valiant's Theory of the Learnable?
por: Hanneke, Steve, et al.
Publicado: (2026)

Mean Estimation from Coarse Data: Characterizations and Efficient Algorithms
por: Kalavasis, Alkis, et al.
Publicado: (2026)

Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion
por: Mehrotra, Anay, et al.
Publicado: (2026)

Transfer Learning Beyond Bounded Density Ratios
por: Kalavasis, Alkis, et al.
Publicado: (2024)

Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases and Beyond
por: Kalavasis, Alkis, et al.
Publicado: (2025)

Linear Regression with Unknown Truncation Beyond Gaussian Features
por: Kouridakis, Alexandros, et al.
Publicado: (2026)

DDPM Score Matching and Distribution Learning
por: Chewi, Sinho, et al.
Publicado: (2025)

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

Private Statistical Estimation via Truncation
por: Zampetakis, Manolis, et al.
Publicado: (2025)

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

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
por: Gay, William, et al.
Publicado: (2025)

Robust Learning of Multi-index Models via Iterative Subspace Approximation
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Complexity of Non-Log-Concave Sampling in Fisher Information
por: Chewi, Sinho, et al.
Publicado: (2026)

Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening
por: Kalavasis, Alkis, et al.
Publicado: (2024)

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms
por: Kalavasis, Alkis, et al.
Publicado: (2026)

Linear Regression under Missing or Corrupted Coordinates
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

On Learning Parallel Pancakes with Mostly Uniform Weights
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
por: Attias, Idan, et al.
Publicado: (2025)

Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
por: Gomez-Leos, Alejandro, et al.
Publicado: (2024)

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials
por: Luo, Yuetian, et al.
Publicado: (2023)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

A proximal gradient algorithm for composite log-concave sampling
por: Liu, Linghai, et al.
Publicado: (2026)

On Unbiased Low-Rank Approximation with Minimum Distortion
por: Barnes, Leighton Pate, et al.
Publicado: (2025)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
por: Pensia, Ankit
Publicado: (2024)

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

A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
por: Wadia, Neha S.
Publicado: (2024)

Heavy-tailed Contamination is Easier than Adversarial Contamination
por: Cherapanamjeri, Yeshwanth, et al.
Publicado: (2024)

Learning Mixtures of Gaussians Using Diffusion Models
por: Gatmiry, Khashayar, et al.
Publicado: (2024)

Easy, robust approximate message passing for planted spike models
por: Ivkov, Misha, et al.
Publicado: (2026)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
por: Diakonikolas, Ilias, et al.
Publicado: (2026)

Learning Multinomial Logits in $O(n \log n)$ time
por: Chierichetti, Flavio, et al.
Publicado: (2026)

High-dimensional estimation with missing data: Statistical and computational limits
por: Verchand, Kabir Aladin, et al.
Publicado: (2026)

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
por: Diakonikolas, Ilias, et al.
Publicado: (2026)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
por: Hanneke, Steve, et al.
Publicado: (2026)

Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
por: Diakonikolas, Ilias, et al.
Publicado: (2026)

The Geometry of Efficient Nonconvex Sampling
por: Vempala, Santosh S., et al.
Publicado: (2026)

Rényi-infinity constrained sampling with $d^3$ membership queries
por: Kook, Yunbum, et al.
Publicado: (2024)