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

Trend · papers per month

3577141,0711,428 · Jun 202019922001200920172026
48 results for glass box models

DNAMite creates interpretable, calibrated survival analysis models.

problem Limited interpretability in survival analysis models, especially for healthcare applications.
method Feature discretization and kernel smoothing in embedding module for flexible shape functions.
result DNAMite produces calibrated shape functions interpretable as contributions to cumulative incidence function.

Recently proposed models which learn to write computer programs from data use either input/output examples or rich execution traces. Instead, we argue that a novel alternative is to use a glass-box loss function, given as a program itself that can be directly inspected. Glass-box optimization covers a wide range of pro…

2017-09-25abs ↗pdf ↗

Paper proposes hybrid approach for transparent credit scoring models.

problem Lack of transparency in machine learning models limits their use in regulated environments.
method Post-hoc interpretation of black-box models guides feature selection, followed by training glass-box models.
result Reduces feature usage from 106 to 10 while maintaining comparable performance.

Automated feature engineering improves interpretable models without manual work.

problem Lack of interpretability in complex models causes trust and stability issues.
method Use elastic black-box models to create simpler, interpretable glass-box models.
result Extracted features from complex models improve linear model performance.

ParamBoost uses gradient boosting to create interpretable non-linear models with constraints.

problem Creating interpretable non-linear models with expert knowledge constraints.
method Gradient Boosting of cubic polynomials with specified constraints.
result ParamBoost outperforms state-of-the-art GAMs in real-world datasets.

Complex black-box predictive models may have high accuracy, but opacity causes problems like lack of trust, lack of stability, sensitivity to concept drift. On the other hand, interpretable models require more work related to feature engineering, which is very time consuming. Can we train interpretable and accurate mod…

2019-02-28abs ↗pdf ↗

Optimal allocation between explainable and black box models for high performance and explainability.

problem Balancing explainability and performance in model ensembles.
method Optimal allocation of observations between explainable and black box models to maximize ensemble performance and explainability.
result Learned allocations maintain high ensemble performance and explainability, sometimes outperforming individual models.

Bayesian hybrid models fuse physics-based insights with machine learning constructs to correct for systematic bias. In this paper, we compare Bayesian hybrid models against physics-based glass-box and Gaussian process black-box surrogate models. We consider ballistic firing as an illustrative case study for a Bayesian …

2019-12-12abs ↗pdf ↗

GLASS Flows improves flow and diffusion model performance by optimizing sampling efficiency.

problem Efficiency bottleneck in sampling Markov transitions for flow and diffusion models.
method Introduces GLASS Flows, a new sampling paradigm that simulates a 'flow matching model within a flow matching model' to sample Markov transitions efficiently.
result Eliminates the trade-off between stochastic evolution and efficiency in large-scale text-to-image models.

EBMs become opaque in high dimensions; LASSO sparsifies them.

problem Reducing complexity and improving interpretability of EBMs in high-dimensional settings.
method Applying LASSO to reweight and remove less relevant terms from EBMs.
result EBMs maintain transparency and fast scoring times with reduced complexity.

We analyze operational risk in terms of a spin glass model. Several regimes are investigated, as a functions of the parameters that characterize the dynamics. The system is found to be robust against variations of these parameters. We unveil the presence of limit cycles and scrutinize the features of the asymptotic sta…

2010-02-18abs ↗pdf ↗

New method generates equilibrium glass configurations efficiently.

problem Sampling equilibrium configurations of amorphous materials is slow and difficult.
method Riemannian stochastic interpolation framework combining Riemannian stochastic interpolant and equivariant flow matching.
result Enforcing geometric and symmetry constraints significantly improves generative performance.

We consider the problem of rational decision making in the presence of nonlinear constraints. By using tools borrowed from spin glass and random matrix theory, we focus on the portfolio optimisation problem. We show that the number of ``optimal'' solutions is generically exponentially large: rationality is thus de fact…

1998-01-21abs ↗pdf ↗

Deep neural networks favor symmetric structures, enabling multilevel symmetries.

problem Understanding and optimizing deep neural networks.
method Formulating DNN training as convex Lasso problems with geometric algebra.
result Deep networks inherently favor symmetric structures, enabling multilevel symmetries.

MPF method improves parameter estimation in probabilistic models.

problem Difficulty in fitting probabilistic models due to intractable partition function.
method Minimum Probability Flow (MPF) method for parameter estimation.
result MPF outperforms existing techniques in convergence time and accuracy.

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.

We present GLASSES: Global optimisation with Look-Ahead through Stochastic Simulation and Expected-loss Search. The majority of global optimisation approaches in use are myopic, in only considering the impact of the next function value; the non-myopic approaches that do exist are able to consider only a handful of futu…

2015-10-21abs ↗pdf ↗

EBM improves car insurance claim severity and frequency prediction while maintaining interpretability.

problem Balancing predictive accuracy and interpretability in insurance claim modeling.
method Combines GAM and cyclic gradient boosting, providing interpretable predictions.
result EBM outperforms benchmark models in claim severity and frequency prediction.

New statistical methods improve explainability of boosting models.

problem Uncertainty quantification for boosting models is computationally intensive and hard to interpret.
method Derive methods for statistical inference using gradient boosting and Boulevard regularization.
result Achieve asymptotically normal predictions with theoretical guarantees and runtime independent of data size.

New framework to understand and exploit curvature in deep learning loss landscapes.

problem Understanding and optimizing the loss landscape in deep learning models.
method New conceptual framework and techniques to estimate and exploit curvature of expected loss changes.
result Alice algorithm optimizes training by incorporating curvature terms and step bounds.

This thesis explores emergent intelligence in disordered systems like spin glasses and neural networks.

problem Understanding the principles behind emergent intelligent behaviors in disordered systems.
method Statistical physics approach to charting learning mechanisms and dynamics.
result Uncovering relationships between learning mechanisms and physical dynamics.

Derives TAP approximation for Bayesian linear regression.

problem Log-normalizing constant of posterior distribution in high-dimensional linear regression.
method Variational representation and Thouless-Anderson-Palmer approximation.
result Proves TAP approximation for spherical prior in proportional asymptotic regime.

Injectivity of ReLU networks studied using statistical physics.

problem When can the input of a ReLU neural network be inferred from its output?
method Connection to spherical integral geometry and statistical physics.
result Replica symmetry-breaking theory and Gordon's min--max theorem provide insights into the injectivity threshold.

Study free energy in spherical spin glasses, proving universality dichotomy.

problem Analyzing free energy in spherical spin glass models with different tail exponents.
method Introduced a tail-adapted normalization and used universality dichotomy.
result Sharp universality dichotomy for free energy across different tail exponents.

Financial markets are a classical example of complex systems as they comprise many interacting stocks. As such, we can obtain a surprisingly good description of their structure by making the rough simplification of binary daily returns. Spin glass models have been applied and gave some valuable results but at the price…

2012-06-20abs ↗pdf ↗

The study reveals the spectral structure of attention layers and its implications for generalization.

problem Understanding the spectral structure and generalization of trained attention layers.
method Empirical risk minimization in a single-head tied-attention layer, using random matrix theory, spin-glass theory, and approximate message passing.
result Exact high-dimensional characterization of training and test error, interpolation and recovery thresholds, and spectrum of the key and query matrices.

We study the problem of detecting the presence of a single unknown spike in a rectangular data matrix, in a high-dimensional regime where the spike has fixed strength and the aspect ratio of the matrix converges to a finite limit. This setup includes Johnstone's spiked covariance model. We analyze the likelihood ratio …

2018-02-20abs ↗pdf ↗

Sharp asymptotics reveal how network width controls learnability in quadratic neural networks.

problem Understanding learnability in overparameterized quadratic neural networks.
method Mapping ERM to convex matrix sensing with nuclear norm penalization.
result Characterization of global minima and precise generalization thresholds.

NGRs merge sparse graph recovery with PGMs for efficient probabilistic inference.

problem Efficiently recover sparse graphs and learn distributions over variables.
method Integrates sparse graph recovery methods with PGMs using Graph-constrained path norm.
result NGRs can handle multimodal data and perform sparse graph recovery and probabilistic inference.

In this paper I give a brief introduction to a family of simple but non-trivial models designed to increase our understanding of collective processes in markets, the so-called Minority Games, and their non-equilibrium statistical mathematical analysis. Since the most commonly studied members of this family define disor…

2002-05-13abs ↗pdf ↗

A statistical physics model for the time evolutions of stock portfolios is proposed. In this model the time series of price changes are coded into the sequences of up and down spins. The Hamiltonian of the system is introduced and is expressed by spin-spin interactions as in spin glass models of disordered magnetic sys…

2000-11-09abs ↗pdf ↗

This paper gives necessary and sufficient conditions that the free product with amalgamation of circularly-ordered groups admit a circular ordering extending the given orderings of the factors. Our result follows from establishing a categorical framework that allows the problem to be restated in terms of amalgamating c…

2018-07-21abs ↗pdf ↗

We show that every irreducible toroidal integer homology sphere graph manifold has a left-orderable fundamental group. This is established by way of a specialization of a result due to Bludov and Glass for the almagamated products that arise, and in this setting work of Boyer, Rolfsen and Wiest may be applied. Our resu…

2011-06-02abs ↗pdf ↗