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

推荐订阅源

博客园 - 司徒正美
T
The Blog of Author Tim Ferriss
F
Fortinet All Blogs
Martin Fowler
Martin Fowler
罗磊的独立博客
The GitHub Blog
The GitHub Blog
L
LangChain Blog
A
About on SuperTechFans
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
D
DataBreaches.Net
宝玉的分享
宝玉的分享
U
Unit 42
阮一峰的网络日志
阮一峰的网络日志
Last Week in AI
Last Week in AI
N
Netflix TechBlog - Medium
The Cloudflare Blog
Microsoft Azure Blog
Microsoft Azure Blog
H
Help Net Security
美团技术团队
大猫的无限游戏
大猫的无限游戏
雷峰网
雷峰网
爱范儿
爱范儿
酷 壳 – CoolShell
酷 壳 – CoolShell
MongoDB | Blog
MongoDB | 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
CHASSIS - Inverse Modelling of Relaxed Dynamical Systems
Dalia Chakrabarty · 2009-05-15 · via math.ST updates on arXiv.org

The state of a non-relativistic gravitational dynamical system is known at any time $t$ if the dynamical rule, i.e. Newton's equations of motion, can be solved; this requires specification of the gravitational potential. The evolution of a bunch of phase space coordinates ${\bf w}$ is deterministic, though generally non-linear. We discuss the novel Bayesian non-parametric algorithm CHASSIS that gives phase space $pdf$ $f({\bf w})$ and potential $Φ({\bf x})$ of a relaxed gravitational system. CHASSIS is undemanding in terms of input requirements in that it is viable given incomplete, single-component velocity information of system members. Here ${\bf x}$ is the 3-D spatial coordinate and ${\bf w}={\bf x+v}$ where ${\bf v}$ is the 3-D velocity vector. CHASSIS works with a 2-integral $f=f(E, L)$ where energy $E=Φ+ v^2/2, \: v^2 = \sum_{i=1}^{3}{v_i^2}$ and the angular momentum is $L = |{\bf r}\times{\bf v}|$, where ${\bf r}$ is the spherical spatial vector. Also, we assume spherical symmetry. CHASSIS obtains the $f(\cdot)$ from which the kinematic data is most likely to have been drawn, in the best choice for $Φ(\cdot)$, using an MCMC optimiser (Metropolis-Hastings). The likelihood function ${\cal{L}}$ is defined in terms of the projections of $f(\cdot)$ into the space of observables and the maximum in ${\cal{L}}$ is sought by the optimiser.