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,657 papers · 148 categories

Trend · papers per month

2955908851,180 · Jun 202019922001200920172026
48 results for replica method

We discuss replica analytic continuation using several simple models in order to prove mathematically the validity of replica analysis, which is used in a wide range of fields related to large scale complex systems. While replica analysis consists of two analytical techniques, the replica trick (or replica analytic con…

2016-06-23abs ↗pdf ↗

A fast, approximate method for variable selection in GLMs tackles correlated data.

problem Variable selection in generalized linear models with correlated data.
method Replica method of statistical mechanics and vector approximate message passing.
result The proposed algorithm provides fast convergence and high approximation accuracy.

Dense Associative Memories outperform classical networks in robustness and signal processing.

problem Improving neural network performance in adversarial attacks and weak signal processing.
method Relaxing replica symmetry in statistical mechanics of spin glasses to analyze unsupervised and supervised learning.
result Explicit analytical investigation of phase diagrams and storage capacities for Dense Associative Memories.

SOCRATES uses LLMs to automate simulation optimization of complex systems.

problem Optimizing complex, expensive-to-sample stochastic systems.
method Two-stage procedure: replica construction and meta-optimization.
result Adaptive hybrid optimization schedule for real systems.

We use variational Gaussian approximations to analyze parametric models with unknown data-generating distributions.

problem Analyzing inference and learning in parametric models with unknown or intractable data-generating distributions.
method Replica method with variational Gaussian approximation in grand canonical formalism.
result Stationarity conditions adaptively determine parameters of the trial Hamiltonian for each dataset.

The paper estimates key metrics for linear models with Markov or hidden Markov sources.

problem Estimating free energy, mutual information, and MMSE for linear models with specific signal priors.
method Replica analysis in statistical physics, focusing on Markov and hidden Markov sources.
result The linear model with Markov or hidden Markov sources can be simplified into decoupled AWGN channels.

BLADE uses Bayesian methods to discover complex systems from scarce data.

problem Efficiently discovering governing equations of complex dynamical systems from limited data.
method Combines replica-exchange stochastic gradient Langevin Monte Carlo with active learning.
result Reduces measurement requirements by 60% for Lotka-Volterra and 40% for Burgers' equation.

This paper optimizes deep learning training by efficiently sharding weight updates across replicas.

problem Redundant weight update computation on all replicas in data-parallel training.
method Automatic sharding of weight updates using static analysis and transformations on the training graph.
result Substantial speedups achieved on large-scale models using Cloud TPUs.

In this paper, we use replica analysis to determine the investment strategy that can maximize the net present value for portfolios containing multiple development projects. Replica analysis was developed in statistical mechanical informatics and econophysics to evaluate disordered systems, and here we use it to formula…

2018-10-15abs ↗pdf ↗

The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti and M. Mézard [Eur. Phys. B. 57, 175 (2007)]; however, they have not yet developed an approximate derivation method for fin…

2010-08-23abs ↗pdf ↗

Binary perceptron's instability linked to replica symmetry breaking.

problem Understanding the relationship between algorithmic instability and replica symmetry breaking in binary perceptron learning.
method Established the connection between algorithmic instability and replica symmetry breaking by comparing the instability condition around the fixed point to the instability for breaking the replica symmetric solution of the free energy function.
result The instability condition around the algorithmic fixed point is identical to the instability for breaking the replica symmetric saddle point solution of the free energy function.

In the present work, the optimal portfolio minimizing the investment risk with cost is discussed analytically, where this objective function is constructed in terms of two negative aspects of investment, the risk and cost. We note the mathematical similarity between the Hamiltonian in the mean-variance model and the Ha…

2018-02-09abs ↗pdf ↗

In this paper, we use replica analysis to investigate the influence of correlation among the return rates of assets on the solution of the portfolio optimization problem. We consider the behavior of the optimal solution for the case where the return rate is described with a single-factor model and compare the findings …

2017-04-05abs ↗pdf ↗

This study analyzes quantization in deep learning models using statistical physics methods.

problem The computational resource requirements for large-scale data analysis models.
method Typical case analysis from statistical physics, specifically the replica method.
result Optimal quantization width minimizes error and delays overfitting.

Study binary perceptrons' capacity using random duality theory.

problem Characterize the capacity of binary perceptrons with general thresholds.
method Utilized fully lifted random duality theory (fl RDT) to characterize the capacity.
result Characterizations match replica symmetry breaking predictions and uncover the capacity for zero-threshold scenario.

We use a replica approach to deal with portfolio optimization problems. A given risk measure is minimized using empirical estimates of asset values correlations. We study the phase transition which happens when the time series is too short with respect to the size of the portfolio. We also study the noise sensitivity o…

2006-08-03abs ↗pdf ↗

This research highlights the secrecy potential of nonlinear generative models and their all-or-nothing phase transition.

problem Secrecy potential of nonlinear generative models in statistical learning.
method Replica method to derive asymptotic normalized cross entropy and statistical decoupling of Bayesian estimator.
result Strictly nonlinear models exhibit an all-or-nothing phase transition, leading to perfect secrecy.

We consider the problem of mean-variance portfolio optimization for a generic covariance matrix subject to the budget constraint and the constraint for the expected return, with the application of the replica method borrowed from the statistical physics of disordered systems. We find that the replica symmetry of the so…

2016-06-28abs ↗pdf ↗

Proves formula for reconstruction performance in generalized linear models.

problem Analyzing reconstruction performance in generalized linear models with arbitrary bounded spectrum.
method Message passing algorithms and dynamical system stability analysis.
result Analytical formula confirms replica method conjecture for convex models.

Proposes r2SGLD for efficient constrained exploration in non-convex learning.

problem Stagnation in high-temperature chains of reSGLD in distribution tails.
method r2SGLD: replica exchange with reflection steps in a bounded domain.
result Reflection steps enhance mixing rates with quadratic improvement in domain diameter.

Study dynamics of alternating minimization for bilinear regression under large system limits.

problem Understanding the time evolution of alternating minimization for bilinear regression.
method Replica method applied to a multi-temperature glassy system.
result Dynamics of alternating minimization can be described by a two-dimensional discrete stochastic process.

New sampler tackles complex discrete energy landscapes efficiently.

problem Stagnation in gradient-based discrete samplers for non-convex settings.
method DREXEL sampler with Replica Exchange and Adjusted Metropolis.
result Proves samplers satisfy detailed balance and converge to target distribution.

Improved reSGLD accelerates convergence in non-convex learning problems.

problem Inefficient swaps due to noisy energy estimators in reSGLD.
method Variance reduction for noisy energy estimators, theoretical analysis, and numerical experiments.
result Exponential acceleration in convergence for non-convex learning problems.

We study high-dimensional Gaussian mixture classification using statistical physics methods.

problem Classifying high-dimensional Gaussian mixture with general covariance matrices.
method Replica method from statistical physics for asymptotic analysis of convex classifiers.
result Construction and validation of a de-biased estimator for variable selection.

This work improves autonomous racing by creating diverse opponents and adapting risk.

problem Balancing performance and safety in autonomous racing environments.
method Developed a self-play method using replica-exchange Markov chain Monte Carlo for diverse opponents and a distributionally robust bandit optimization for adaptive risk adjustment.
result Demonstrated real-time motion-planning methods achieving speeds comparable to Formula One racecars.

In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we anal…

2016-09-18abs ↗pdf ↗

The study improves the perceptron's storage capacity by optimizing variable selection.

problem Distinguishing genuine structure from random correlations in high-dimensional data.
method Replica method from statistical mechanics for optimal variable selection.
result Optimal variable selection can surpass the Cover--Gardner bound for pattern classification.

Paper introduces supervised and unsupervised TAM models for binary neurons.

problem Learning and retrieval of structured triplets of patterns in neural networks.
method Extends Hebbian paradigm to supervised and unsupervised protocols, using glassy statistical mechanical techniques.
result Obtained self-consistency equations for critical dataset sizes and retrieval performance.

Toy model study shows resampling/reweighting can improve feature learning in imbalanced classification.

problem Improving feature learning in imbalanced classification problems.
method High-dimensional toy model with replica method, class-wise resampling/reweighting, and simplified model.
result No resampling/reweighting can sometimes give best feature learning performance.

We rigorously prove statistical physics predictions for non-convex GLMs in high dimensions.

problem Analyzing high-dimensional optimization problems in non-convex Generalized Linear Models.
method Developed a systematic framework using the Gaussian Min-Max Theorem and AMP to rigorously prove replica-symmetric formulas.
result Validated statistical physics predictions for non-convex GLMs, aligning with physicist's conjectures.

Derives asymptotic generalization error for large-margin classifiers.

problem Understanding the generalization error of large-margin classifiers.
method Statistical physics replica method for deriving asymptotic expression.
result Establishes phase transition boundary for class separability.

We describe parallel Markov chain Monte Carlo methods that propagate a collective ensemble of paths, with local covariance information calculated from neighboring replicas. The use of collective dynamics eliminates multiplicative noise and stabilizes the dynamics thus providing a practical approach to difficult anisotr…

2016-07-13abs ↗pdf ↗