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

推荐订阅源

C
Check Point Blog
有赞技术团队
有赞技术团队
博客园 - 三生石上(FineUI控件)
博客园_首页
博客园 - 【当耐特】
WordPress大学
WordPress大学
月光博客
月光博客
博客园 - 叶小钗
S
SegmentFault 最新的问题
雷峰网
雷峰网
H
Help Net Security
宝玉的分享
宝玉的分享
A
About on SuperTechFans
IT之家
IT之家
J
Java Code Geeks
Hugging Face - Blog
Hugging Face - Blog
D
DataBreaches.Net
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 聂微东
T
The Blog of Author Tim Ferriss
B
Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Y
Y Combinator Blog

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
The Riemannian barycentre as a proxy for global optimisation
Salem Said, Jonathan H. Manton · 2019-02-11 · via math.ST updates on arXiv.org

Let $M$ be a simply-connected compact Riemannian symmetric space, and $U$ a twice-differentiable function on $M$, with unique global minimum at $x^* \in M$. The idea of the present work is to replace the problem of searching for the global minimum of $U$, by the problem of finding the Riemannian barycentre of the Gibbs distribution $P_{\scriptscriptstyle{T}} \propto \exp(-U/T)$. In other words, instead of minimising the function $U$ itself, to minimise $\mathcal{E}_{\scriptscriptstyle{T}}(x) = \frac{1}{2}\int d^{\scriptscriptstyle 2}(x,z)P_{\scriptscriptstyle{T}}(dz)$, where $d(\cdot,\cdot)$ denotes Riemannian distance. The following original result is proved : if $U$ is invariant by geodesic symmetry about $x^*$, then for each $δ< \frac{1}{2} r_{\scriptscriptstyle cx}$ ($r_{\scriptscriptstyle cx}$ the convexity radius of $M$), there exists $T_{\scriptscriptstyle δ}$ such that $T \leq T_{\scriptscriptstyle δ}$ implies $\mathcal{E}_{\scriptscriptstyle{T}}$ is strongly convex on the geodesic ball $B(x^*,δ)\,$, and $x^*$ is the unique global minimum of $\mathcal{E}_{\scriptscriptstyle{T\,}}$. Moreover, this $T_{\scriptscriptstyle δ}$ can be computed explicitly. This result gives rise to a general algorithm for black-box optimisation, which is briefly described, and will be further explored in future work.