Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

54109163217 · Jun 202019922001200920172026
48 results for Gibbs free energy

This work develops machine learning for micromagnetic energy minimization.

problem Minimizing Gibbs free energy in full 3D micromagnetic simulations.
method Advanced machine learning techniques, including Physics-Informed Neural Networks (PINNs) and Extreme Learning Machines (ELMs), with reformulated bounds and optimization schemes.
result Competitive performance of machine learning methods compared to traditional numerical approaches.

The formal structure of geometrical thermodynamics is reviewed with particular emphasis on the geometry of equilibria submanifolds. On these submanifolds thermodynamic metrics are defined as the Hessian of thermodynamic potentials. Links between geometry and thermodynamics are explored for single and multiple component…

2005-07-08abs ↗pdf ↗

Modified Gibbs-Helmholtz equation geometric models for thermodynamics.

problem Geometric interpretation of Gibbs-Helmholtz equation in thermodynamics.
method Developed new holonomic and non-holonomic geometric models associated to Gibbs-Helmholtz equation.
result Characterized equivalence between Gibbs-Helmholtz entropy and other entropies.

Bayesian models' singular fluctuation is shown to be akin to specific heat, influencing model complexity and generalization.

problem Understanding the thermodynamic interpretation of singular fluctuation in Bayesian models.
method Showed singular fluctuation as the curvature of Bayesian free energy and variance of log-likelihood observable under a Gibbs posterior.
result Singular fluctuation is the statistical analogue of specific heat, controlling model complexity and generalization.

The inference of correlated signal fields with unknown correlation structures is of high scientific and technological relevance, but poses significant conceptual and numerical challenges. To address these, we develop the correlated signal inference (CSI) algorithm within information field theory (IFT) and discuss its n…

2016-12-26abs ↗pdf ↗

This work analyzes Gibbs samplers for Bayesian hierarchical models without dimensionality constraints.

problem Analyzing convergence properties of Gibbs samplers for Bayesian hierarchical models.
method Using Bayesian asymptotics and total variation mixing times, the study provides dimension-free convergence results.
result Dimension-free convergence results for Gibbs samplers targeting hierarchical models under random data-generating assumptions.

In a closed economic system, money is conserved. Thus, by analogy with energy, the equilibrium probability distribution of money must follow the exponential Gibbs law characterized by an effective temperature equal to the average amount of money per economic agent. We demonstrate how the Gibbs distribution emerges in c…

2000-01-30abs ↗pdf ↗

Bayesian inference over admissible histories leads to irreversible kinetics.

problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.

We propose a hierarchy for approximate inference based on the Dobrushin, Lanford, Ruelle (DLR) equations. This hierarchy includes existing algorithms, such as belief propagation, and also motivates novel algorithms such as factorized neighbors (FN) algorithms and variants of mean field (MF) algorithms. In particular, w…

2012-07-04abs ↗pdf ↗

Paper analyzes Hit-and-Run's convergence rates and applies similar methods to randomized Kaczmarz.

problem Quantifying advantages of Hit-and-Run's coordinate-free property.
method Sharp estimates via coupling methods and mixing time bounds.
result Ballistic and superdiffusive convergence rates in certain settings.

The paper presents two schemes for sampling matrices from specific distributions on a manifold.

problem Sampling matrices from Gibbs distributions on the manifold of positive semi-definite matrices with fixed rank.
method Two explicit schemes based on Euler-Maruyama discretization of the Riemannian Langevin equation with Brownian motion on the manifold.
result Numerical validation of the schemes using specific energy functions and metrics.

Study on Metropolis-within-Gibbs schemes for high-dimensional Bayesian models.

problem Improving the scalability of MCMC methods for complex Bayesian models.
method Relating convergence properties to conditional conductance for non-conjugate hierarchical models.
result Established dimension-free convergence results for Metropolis-within-Gibbs schemes.

We provide an exact solution to the ideal-gas-like models studied in econophysics to understand the microscopic origin of Pareto-law. In these class of models the key ingredient necessary for having a self-organized scale-free steady-state distribution is the trading or collision rule where agents or particles save a d…

2006-03-17abs ↗pdf ↗

Adaptive sampling for multimodal distributions converges faster than classical methods.

problem Sampling from multimodal distributions efficiently.
method Adaptive linear dynamics with adaptive diffusion coefficients and vector fields, interpreted as weighted Wasserstein gradient flows.
result Derivative-free dynamics can achieve significantly faster convergence for nonconvex potentials.

New algorithm improves mixing in Bayesian mixture models.

problem Slow mixing in Bayesian mixture models.
method A new Monte Carlo algorithm for sampling from the marginal posterior of a general integrable mixture.
result The new algorithm achieves excellent mixing times, outperforming standard Gibbs sampling in some cases.

New method speeds up sampling of Markov random fields.

problem Efficient sampling of Markov random fields is computationally expensive.
method Introduced a new class of Markov random fields linked to Gaussian Markov Random fields for faster sampling.
result At least 35x faster and 37x less energy consumption compared to Gibbs sampling.

We analyze Gibbs-based transfer learning algorithms using information theory.

problem Understanding the generalization error of transfer learning.
method Information-theoretic analysis focusing on αα-weighted-ERM and two-stage-ERM.
result Exact characterization of generalization behavior using conditional symmetrized KL information.

Likelihood-free methods such as approximate Bayesian computation (ABC) have extended the reach of statistical inference to problems with computationally intractable likelihoods. Such approaches perform well for small-to-moderate dimensional problems, but suffer a curse of dimensionality in the number of model parameter…

2019-06-11abs ↗pdf ↗

Extends DAMs to Gaussian distributions for efficient pattern storage and retrieval.

problem Limited storage capacity and retrieval methods for non-vector pattern representations.
method Introduces a log-sum-exp energy function over Gaussian distributions, using optimal transport maps for retrieval dynamics.
result Proves exponential storage capacity and provides quantitative retrieval guarantees.

Study birth-death dynamics for sampling Gibbs measures with nonconvex potentials.

problem Sampling Gibbs measures with nonconvex potentials.
method Birth-death dynamics, Kullback-Leibler divergence, χ2χ^2 divergence, kernel-based approximations, ΓΓ-convergence of gradient flows.
result Probability density converges exponentially fast to Gibbs equilibrium measure with a universal rate.

Improved text generation with constraints using discrete auto-regressive biasing.

problem Balancing fluency and constraint satisfaction in LLM outputs.
method Discrete Auto-regressive Biasing, leveraging gradients in discrete text space.
result Significantly improved constraint satisfaction with comparable fluency.

Mounting evidences are being gathered suggesting that income and wealth distribution in various countries or societies follow a robust pattern, close to the Gibbs distribution of energy in an ideal gas in equilibrium, but also deviating significantly for high income groups. Application of physics models seem to provide…

2007-03-21abs ↗pdf ↗

Deep neural networks improve free energy calculations for peptide conformations.

problem Challenges in developing suitable mappings for free energy perturbation.
method Adapted machine learning approach to train deep neural networks for mapping between Boltzmann distributions.
result Accurate free energy differences calculated between thermodynamic states with spring centers separated by 1 Å and sometimes 2 Å.

We use matricial free energy to regularize autoencoders, producing Gaussian-like codes.

problem Generating Gaussian-like codes for autoencoders.
method Define a differentiable loss function based on singular values of the code matrix, minimizing matricial free energy.
result Minimizing matricial free energy results in Gaussian-like codes that generalize.

Extends probabilistic approach for Kahler-Einstein metrics on Fano manifolds.

problem Constructing Kahler-Einstein metrics on log Fano manifolds with non-discrete automorphism groups.
method Introduces Gibbs polystability and uses moment map constraint to break symmetry.
result Gibbs polystability conjectured to be equivalent to existence of Kahler-Einstein metric.

Study on existence of ground states for free energy on hyperbolic space.

problem Existence of ground states for a free energy functional on hyperbolic space.
method Derived HLS-type inequalities on Cartan-Hadamard manifolds to prove existence.
result Established conditions for the existence of ground states on hyperbolic space.

New result on critical points of Bethe free energy under deformation retracts.

problem Characterizing critical points of Bethe free energy for complex graphs.
method Analyzing homotopy types and deformation retracts of factor graphs.
result Critical points of Bethe free energy are invariant under deformation retracts.

Study of phase separation and geometry on a closed elastic curve, including dynamics and free energy minimization.

problem Free energy and dynamics of a closed elastic filament coupled to a scalar concentration field.
method Analytical and numerical simulations of coupled Willmore flow and Cahn--Hilliard gradient flow on differential geometry.
result Qualitative changes in free energy landscape due to closure constraint, leading to metastable and stable multi-domain morphologies.

Active inference minimizes expected free energy for optimal behavior.

problem Understanding and optimizing behavior in complex systems.
method Combines Bayesian decision theory, optimal Bayesian design, and the free energy principle.
result Active inference emerges as a unified framework for information-seeking, utility maximization, and goal-directed behavior.

Paper analyzes the free energy of CNNs with skip connections in Bayesian learning.

problem Dependency of CNNs with skip connections on the number of parameters.
method Examines the Bayesian free energy of CNNs with and without skip connections.
result The upper bound of free energy of Bayesian CNN with skip connections does not depend on overparametrization.

New method uses neural networks to improve free energy estimation.

problem Estimating free energy differences using FEP is limited by insufficient overlap between distributions.
method Developed a neural network to parameterize a high-dimensional mapping in configuration space.
result Demonstrated substantial variance reduction in free energy estimates.

THRML uses energy-based models for index tracking, reducing portfolio tracking error and improving returns.

problem NP-hard combinatorial optimization in portfolio optimization under cardinality constraints.
method THRML reformulates index tracking as probabilistic inference on an Ising Hamiltonian, using GPU-accelerated block Gibbs sampling.
result THRML achieves 4.31 percent annualized tracking error compared to 5.66-6.30 percent for baselines, with 128.63 percent total return.