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

3517021,0521,403 · Jun 202019922001200920172026
48 results for MEM models

Generative models learn rules at different timescales, revealing a 'innovation window'.

problem Generative models' convergence to empirical training distribution rather than population distribution.
method Rule-valid synthetic tasks, analyzing τruleτ_{\mathrm{rule}} and τmemτ_{\mathrm{mem}} across training timescales.
result The 'innovation window' widens with increasing dataset size and narrows with rule complexity.

The MEM method uses data-driven priors for linear inverse problems, proving convergence and estimating differences.

problem Linear inverse problems with approximate priors.
method Maximum Entropy on the Mean (MEM) method with data-driven priors.
result Empirical mean convergence and estimates for prior differences based on epigraphical distance.

New models analyze how ECB's unconventional policies affect stock market volatility.

problem Analyzing the impact of ECB's unconventional policies on stock market volatility.
method Developed MEM with Asymmetry and Policy effects (MAP) models to separate base volatility from policy effects.
result Significant improvement in forecasting power after Expanded Asset Purchase Programme implementation.

Many real-world tasks such as classification of digital histopathology images and 3D object detection involve learning from a set of instances. In these cases, only a group of instances or a set, collectively, contains meaningful information and therefore only the sets have labels, and not individual data instances. In…

2019-11-18abs ↗pdf ↗

The Multiplicative Error Model (Engle (2002)) for nonnegative valued processes is specified as the product of a (conditionally autoregressive) scale factor and an innovation process with nonnegative support. A multivariate extension allows for the innovations to be contemporaneously correlated. We overcome the lack of …

2016-04-05abs ↗pdf ↗

Diffusion models generalize well until a threshold is reached, preventing memorization.

problem Understanding why diffusion models don't memorize training data.
method Investigation of training dynamics and two timescales: τgenτ_\mathrm{gen} and τmemτ_\mathrm{mem}.
result The threshold τmemτ_\mathrm{mem} increases linearly with training set size nn, preventing memorization.

We show that an orientable 3-dimensional manifold M admits a complete riemannian metric of bounded geometry and uniformly pos- itive scalar curvature if and only if there exists a finite collection F of spherical space-forms such that M is a (possibly infinite) connected sum where each summand is diffeomorphic to S2xS1…

2010-01-09abs ↗pdf ↗

Improved neural network predicts spectral functions more accurately than traditional methods.

problem Reconstructing real-time spectral functions from imaginary-time Green's functions is ill-posed and challenging.
method Feature Learning Network (FL-net) for enhanced prediction accuracy.
result FL-net achieves at least 20% improvement over traditional methods like MEM.

VOLARE provides standardized realized volatility measures from financial data.

problem Lack of standardized realized volatility measures from ultra-high-frequency data.
method Asset-specific pipeline for cleaning and sampling data, providing a wide range of realized estimators.
result Comprehensive set of realized estimators for equities, exchange rates, and futures.

If GG is a free product of finite groups, let ΣAut1(G)ΣAut_1(G) denote all (necessarily symmetric) automorphisms of GG that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, {\em Symmetric Automorphisms of Free Products}, Mem. Amer. Math. Soc. 122 (1996), no. 582] an…

2003-01-08abs ↗pdf ↗

The basin of infinity of a polynomial map $f : {\bf C} \arrow {\bf C}$ carries a natural foliation and a flat metric with singularities, making it into a metrized Riemann surface X(f)X(f). As ff diverges in the moduli space of polynomials, the surface X(f)X(f) collapses along its foliation to yield a metrized simplicial t…

2006-08-30abs ↗pdf ↗

The study uncovers the conditions under which diffusion models memorize or generalize.

problem Understanding the balance between memorization and generalization in diffusion models.
method Theoretical and mathematical framework to investigate memorization and generalization in diffusion models.
result Theoretical crossover point predicts a phase transition in diffusion models, validating the hypothesis.

This paper proposes IMU preintegrated features for efficient deep inertial odometry.

problem Efficient odometry from IMU data is challenging due to sensor imperfections and noise.
method Proposes IMU preintegrated features exploiting IMU motion model's manifold structure.
result Improves odometry performance and reduces computational burdens.

Review of efficient neural networks for TinyML on resource-constrained devices.

problem Resource constraints on ultra-low power MCUs for deep learning models.
method Model compression, quantization, low-rank factorization, model pruning, hardware acceleration, algorithm-architecture co-design.
result Optimized neural network architectures for minimal resource utilization on MCUs.

In this paper we investigate the problem of non-analytic embeddings of Lorentzian manifolds in Ricci-flat semi-Riemannian spaces. In order to do this, we first review some relevant results in the area, and then motivate both the mathematical and physical interest in this problem. We show that any nn-dimensional compac…

2017-08-19abs ↗pdf ↗

SAGE improves memory efficiency by selectively adding, merging, or ignoring new facts.

problem Efficiently managing new facts in agentic LLMs to avoid costly write-time reasoning.
method SAGE uses a von Mises-Fisher-based density estimator to score and route candidate facts.
result SAGE achieves the best average token-F1 on LoCoMo and reduces add-phase API cost by 3.4x on GPT-4o-mini.

Metagenomics characterizes the taxonomic diversity of microbial communities by sequencing DNA directly from an environmental sample. One of the main challenges in metagenomics data analysis is the binning step, where each sequenced read is assigned to a taxonomic clade. Due to the large volume of metagenomics datasets,…

2015-05-26abs ↗pdf ↗

In the online multiple testing problem, p-values corresponding to different null hypotheses are observed one by one, and the decision of whether or not to reject the current hypothesis must be made immediately, after which the next p-value is observed. Alpha-investing algorithms to control the false discovery rate (FDR…

2017-10-02abs ↗pdf ↗

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.