惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

B
Blog
D
Docker
J
Java Code Geeks
腾讯CDC
Blog — PlanetScale
Blog — PlanetScale
G
Google Developers Blog
M
MIT News - Artificial intelligence
L
LangChain Blog
T
The Blog of Author Tim Ferriss
P
Proofpoint News Feed
MyScale Blog
MyScale Blog
博客园 - Franky
GbyAI
GbyAI
Hugging Face - Blog
Hugging Face - Blog
aimingoo的专栏
aimingoo的专栏
Last Week in AI
Last Week in AI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 聂微东
N
Netflix TechBlog - Medium
B
Blog RSS Feed
Y
Y Combinator Blog
阮一峰的网络日志
阮一峰的网络日志
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Google DeepMind News
Google DeepMind News

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Fitting a manifold to data in the presence of large noise
Charles Fefferman, Sergei Ivanov, Matti Lassas, Hariharan Naraya · 2023-12-17 · via math.ST updates on arXiv.org

We assume that $M_0$ is a $d$-dimensional $C^{2,1}$-smooth submanifold of $R^n$. Let $K_0$ be the convex hull of $M_0,$ and $B^n_1(0)$ be the unit ball. We assume that $ M_0 \subseteq \partial K_0 \subseteq B^n_1(0).$ We also suppose that $M_0$ has volume ($d$-dimensional Hausdorff measure) less or equal to $V$, reach (i.e., normal injectivity radius) greater or equal to $τ$. Moreover, we assume that $M_0$ is $R$-exposed, that is, tangent to every point $x \in M$ there is a closed ball of radius $R$ that contains $M$. Let $x_1, \dots, x_N$ be independent random variables sampled from uniform distribution on $M_0$ and $ζ_1, \dots, ζ_N$ be a sequence of i.i.d Gaussian random variables in $R^n$ that are independent of $x_1, \dots, x_N$ and have mean zero and covariance $σ^2 I_n.$ We assume that we are given the noisy sample points $y_i$, given by $$ y_i = x_i + ζ_i,\quad \hbox{ for }i = 1, 2, \dots,N. $$ Let $ε,η>0$ be real numbers and $k\geq 2$. Given points $y_i$, $i=1,2,\dots,N$, we produce a $C^k$-smooth function which zero set is a manifold $M_{rec}\subseteq R^n$ such that the Hausdorff distance between $M_{rec}$ and $M_0$ is at most $ ε$ and $M_{rec}$ has reach that is bounded below by $cτ/d^6$ with probability at least $1 - η.$ Assuming $d < c \sqrt{\log \log n}$ and all the other parameters are positive constants independent of $n$, the number of the needed arithmetic operations is polynomial in $n$. In the present work, we allow the noise magnitude $σ$ to be an arbitrarily large constant, thus overcoming a drawback of previous work.