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

Trend · papers per month

3517021,0521,403 · Jun 202019922001200920172026
48 results for Sherrington-Kirkpatrick model

Algorithm learns Sherrington-Kirkpatrick model parameters at low temperatures.

problem Learning parameters of random graphical models at low temperatures.
method Multiplicative-weight update algorithm for polynomial time learning.
result Algorithm learns SK model parameters at βlognβ\leq \sqrt{\log n}.

This work maps Boltzmann distributions to ARNNs for better physics-based model approximations.

problem Approximating Boltzmann distributions of binary systems.
method Exact mapping of Boltzmann distribution to autoregressive neural network architecture.
result New ARNN architectures derived from physical models show superior performance.

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 ↗

New algorithm nearly achieves ground state free energy of SK model.

problem Determining the ground state free energy of the SK model.
method Controlled Loosening-up (CLuP) algorithm applied to SK models.
result Achieves ground state free energy of ~0.76 for n in the thousands.

We propose a general framework for solving statistical mechanics of systems with finite size. The approach extends the celebrated variational mean-field approaches using autoregressive neural networks, which support direct sampling and exact calculation of normalized probability of configurations. It computes variation…

2018-09-27abs ↗pdf ↗

New method uses quantum annealing and VAN for better statistical mechanics calculations.

problem Difficulty in computing partition function in statistical mechanics.
method Combines quantum annealing samples with variational autoregressive networks.
result Enhanced accuracy in finite-size Sherrington-Kirkpatrick model.

New tools in nonlinear random matrices improve understanding of the Sum of Squares hierarchy.

problem Improving the Sum of Squares (SoS) hierarchy's performance on average-case problems.
method Developed new tools in nonlinear random matrices and applied them to analyze the SoS hierarchy.
result Subexponential-time SoS lower bounds for various problems, offering evidence for the low-degree likelihood ratio hypothesis.

We study the fundamental limits of detecting the presence of an additive rank-one perturbation, or spike, to a Wigner matrix. When the spike comes from a prior that is i.i.d. across coordinates, we prove that the log-likelihood ratio of the spiked model against the non-spiked one is asymptotically normal below a certai…

2018-06-25abs ↗pdf ↗

AMP algorithms can be efficiently simulated by SDPs even with corrupted data.

problem Optimizing average-case optimization problems with corrupted data.
method Local statistics hierarchy semidefinite programs (SDPs) simulate AMP algorithms robustly.
result Robust guarantees for many AMP algorithms are offered, contrasting with strong lower bounds for SDPs.

Study higher-order spin glass models for social network behavior with peer-group effects.

problem Modeling correlation phenomena on social networks with peer-group effects.
method Inference in higher-order Ising models to recover coefficients and peer-group effects.
result Strong concavity of log pseudo-likelihood implies statistical error rate of sqrt(d/n) for MPLE.

CLuP achieves near optimal ground state energies for positive and negative Hopfield models.

problem Finding near optimal ground state energies for positive and negative Hopfield models.
method Controlled Loosening-up (CLuP) algorithm with fully lifted random duality theory (fl RDT).
result Achieves ground state free energies of 1.771.77 and 0.330.33 for positive and negative Hopfield models respectively.

Unified approach learns Ising models from various dynamics and data types.

problem Efficiently learning Ising model parameters from data under diverse conditions.
method Simple logistic regression approach, generalizing existing algorithms.
result Logistic regression succeeds in multiple new settings where assumptions are violated.

Quantum algorithm speeds up MIP solving by a near-quadratic factor.

problem Solving Mixed Integer Programs (MIPs) efficiently.
method Incremental-Quantum-Branch-and-Bound algorithm combining quantum speedup with classical search heuristics.
result Universal near-quadratic speedup over classical Branch-and-Bound algorithms.

The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.

problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.

The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.

problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.

The study examines how model predictions hold up under model extensions.

problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.

Revises Bayesian model averaging for foundation models.

problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.

Paper introduces symmetric divergence link models for probability distributions.

problem Symmetric divergence measures for probability distributions.
method Two general classes of link models: one for survival functions and another for cumulative probability distribution functions.
result Advantages of symmetric divergence measures over asymmetric measures for model averaging and feature assessment.

Researchers review challenges in interpreting additive models, especially neural additive models.

problem Challenges in interpreting additive models, particularly neural additive models.
method Review of generalized additive models and discussion of nonidentifiability.
result Challenges in claiming interpretability or suitability for safety-critical applications of additive models.

Sigma models linked to Gross-Neveu models via quiver varieties.

problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.

Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…

2017-06-26abs ↗pdf ↗

Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.

problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.

This work develops scalable model selection methods with fast update and selection.

problem Efficient model selection for large pools of candidate models.
method Isolated model embedding, which supports asymptotically fast update and selection.
result Standardized Embedder achieves competitive model selection performances.

Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of models.

problem Model risk in multivariate risk forecasting, especially during crises.
method Comprehensive empirical study comparing Copula-GARCH models with fixed marginals, copulas, or neither.
result Model risk is almost entirely due to copula choice, not marginal models.

BayesBlend blends multiple models' predictions for better insurance loss predictions.

problem Improving insurance loss predictions by combining multiple models.
method Pseudo-Bayesian model averaging, stacking, and hierarchical stacking.
result BayesBlend provides a user-friendly way to blend model predictions and estimate weights.

The paper identifies when larger models improve predictions and proposes a switcher model.

problem Understanding when larger models benefit from added complexity.
method Numerical studies on T5 architecture to analyze predictive uncertainty and model performance.
result Large models improve on examples where small models are uncertain, but not on certain examples.

We propose a generalization of neural network sequence models. Instead of predicting one symbol at a time, our multi-scale model makes predictions over multiple, potentially overlapping multi-symbol tokens. A variation of the byte-pair encoding (BPE) compression algorithm is used to learn the dictionary of tokens that …

2017-07-03abs ↗pdf ↗

The paper extends statistical inference methods for black-box generative models.

problem Understanding and validating black-box generative models without access to their internal data.
method Develops model-level statistical inference tasks using generative model representations.
result Model-level representations are effective for multiple inference tasks.