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

100200300400 · Jun 202019922001200920172026
48 results for varying dimensionality

Generative model handles varying data dimensions using jump diffusion processes.

problem Handling data of varying dimensionality in generative models.
method Formulated as a jump diffusion process, learning to approximate the process with a novel evidence lower bound.
result Effective sampling of data of varying dimensionality, better compatibility with test-time diffusion guidance imputation tasks.

Study shows that ridgeless Gaussian kernel regression overfits even with varying bandwidth or dimensionality.

problem Analyzing overfitting in Gaussian kernel ridgeless regression with varying bandwidth or dimensionality.
method Examined the behavior of minimum norm interpolating solutions for fixed and increasing dimensions under varying bandwidth and sample size.
result Ridgeless solutions are never consistent and can be worse than null predictor with large enough noise, even with varying bandwidth or dimensionality.

Adaptive ML learns complex time-varying systems without new data.

problem Applying ML to time-varying systems with shifting distributions.
method Mapping high-dimensional inputs to low-dimensional latent space, actively tuning latent space based on feedback.
result Learning correlations and tracking system evolution in real-time without new data.

Proposes a method for interpreting time-varying causal effect moderation in high-dimensional data.

problem Interpreting causal effect moderation in high-dimensional data with interpretability and avoiding false positives.
method Two-step method: 1) Selects a smaller model for linear causal effect moderation using Gaussian randomization, 2) Conditions on selection to construct a pivot for uniformly asymptotic semi-parametric inference.
result Consistently achieves valid coverage rates and shorter, bounded intervals in time-varying causal effect moderation.

AJL framework detects dynamic patterns in high-dimensional time-varying models.

problem Complex time-varying associations and abrupt regime shifts in longitudinal processes.
method Hierarchical regularization framework integrating functional variable selection with structural changepoint detection.
result The refined estimator achieves the oracle property in ultra-high-dimensional settings.

Paper efficiently infers differential parameters in time-varying models using time score matching.

problem Efficiently inferring differential parameters in time-varying probabilistic models.
method Directly estimates the differential parameter using time score matching and proves consistency of the method.
result Consistent estimation of parameter derivatives in high-dimensional settings.

A new method generates counterfactual treatment outcomes for time-varying treatments.

problem Estimating counterfactual outcomes for time-varying treatments with high-dimensional outcomes.
method Conditional generative framework with inverse probability re-weighting.
result Our method outperforms state-of-the-art baselines in generating high-quality counterfactual samples.

We consider a curve of Fredholm pairs of Lagrangian subspaces in a fixed Banach space with continuously varying (weak) symplectic structures. Assuming vanishing index, we obtain intrinsically a continuously varying splitting of the total Banach space into pairs of symplectic subspaces. Using such decompositions we defi…

2014-06-03abs ↗pdf ↗

Paper proposes efficient methods for forecasting with large datasets.

problem Forecasting with large, high-dimensional economic data sets.
method Bayesian hierarchical priors, factor graphs, message passing algorithms, Generalized Approximate Message Passing (GAMP).
result The proposed methods outperform traditional approaches in forecasting U.S. price inflation.

A new method for solving complex inverse problems using deep learning.

problem Estimating complex spatially-varying parameters in high-dimensional Bayesian inverse problems.
method A variational inference method with a deep generative prior to approximate the posterior distribution.
result The method improves estimation accuracy and efficiency for solving high-dimensional inverse problems.

Correlations between asset returns are important in many financial applications. In recent years, multivariate volatility models have been used to describe the time-varying feature of the correlations. However, the curse of dimensionality quickly becomes an issue as the number of correlations is k(k1)/2k(k-1)/2 for kk asse…

2007-02-27abs ↗pdf ↗

QSurv models survival data without discretization, achieving high accuracy.

problem Intractable likelihood estimation for continuous-time survival models.
method QSurv uses numerical quadrature for cumulative hazard approximation and time-conditioned low-rank adaptation.
result QSurv achieves competitive predictive performance and interpretable hazard patterns.

BASS efficiently learns time-varying graphs with low complexity and automatic tuning.

problem Estimating time-varying graphical models with efficient and automatic parameter tuning.
method BASS uses temporally-dependent spike-and-slab priors and variational inference to learn graph structures efficiently.
result BASS outperforms existing methods in recovering true graphs, especially for high-dimensional cases.

Balanced Neural ODEs combine VAEs and Neural ODEs for efficient time series modeling.

problem Efficiently modeling systems with time-varying inputs and varying complexity.
method Combines VAEs for dimensionality reduction and Neural ODEs for dynamics, using variational parameters to adaptively learn.
result Balanced Neural ODEs (B-NODE) efficiently approximate Koopman operator without predefined dimensionality.

Flexible model captures varying scales in data clusters.

problem Real-world data often exhibits varying scales or intensities, violating the homogeneity assumption of classical Gaussian mixture models.
method Individual-heterogeneous sub-Gaussian mixture model with an efficient spectral method for exact recovery.
result The method provably achieves exact recovery of true cluster labels under mild separation conditions.

We introduce the probabilistic sequential matrix factorization (PSMF) method for factorizing time-varying and non-stationary datasets consisting of high-dimensional time-series. In particular, we consider nonlinear Gaussian state-space models where sequential approximate inference results in the factorization of a data…

2019-10-09abs ↗pdf ↗

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions,…

2016-02-14abs ↗pdf ↗

Estimates the effect of time-varying treatments using machine learning.

problem Estimating the impact of time-varying treatments over multiple periods.
method Difference-in-Differences framework with double/debiased machine learning.
result Higher vaccination rates reduce COVID-19 mortality after several weeks.

We study the parameter estimation problem for a varying index coefficient model in high dimensions. Unlike the most existing works that iteratively estimate the parameters and link functions, based on the generalized Stein's identity, we propose computationally efficient estimators for the high-dimensional parameters w…

2018-10-16abs ↗pdf ↗

A generalization of expectiles for d-dimensional multivariate distribution functions is introduced. The resulting geometric expectiles are unique solutions to a convex risk minimization problem and are given by d-dimensional vectors. They are well behaved under common data transformations and the corresponding sample v…

2017-04-05abs ↗pdf ↗

We address the curse of dimensionality in dynamic covariance estimation by modeling the underlying co-volatility dynamics of a time series vector through latent time-varying stochastic factors. The use of a global-local shrinkage prior for the elements of the factor loadings matrix pulls loadings on superfluous factors…

2016-08-30abs ↗pdf ↗

We simplify Bayesian filtering by framing it as optimization, making it practical for high-dimensional systems.

problem Bayesian filtering struggles in high-dimensional state spaces like neural networks.
method We frame Bayesian filtering as optimization, using gradient descent for nonlinear cases.
result Our method results in effective, robust, and scalable filters for high-dimensional systems.

Efficiently infers time-varying sparse MRFs with strong statistical guarantees.

problem Inference of time-varying sparse MRFs with strong statistical guarantees.
method Constrained optimization with exact 0\ell_0 regularization, near-linear time and memory complexity.
result Sharp statistical guarantees for sparsely-changing Gaussian MRFs with as few as one sample per time.

Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine learning algorithms. We describe a generic mathematical model to leverage quantum…

2019-11-17abs ↗pdf ↗

We present a windowed technique to learn parsimonious time-varying autoregressive models from multivariate timeseries. This unsupervised method uncovers interpretable spatiotemporal structure in data via non-smooth and non-convex optimization. In each time window, we assume the data follow a linear model parameterized …

2019-05-21abs ↗pdf ↗

We consider the problem of varying conformally the metric of a four dimensional manifold in order to obtain constant QQ-curvature. The problem is variational, and solutions are in general found as critical points of saddle type. We show how the problem leads naturally to consider the set of formal barycenters of the m…

2007-12-13abs ↗pdf ↗

KAPLAN-HR models survival data without manual interactions, outperforming existing methods.

problem Survival analysis challenges with complex covariates and time-varying effects.
method Kolmogorov-Arnold Networks (KAN) for nonparametric hazard estimation.
result KAPLAN-HR matches or exceeds existing methods in clinical survival data.

A new method estimates time-varying parameters in earth system models using offline and online data assimilation.

problem Estimating time-varying parameters in complex earth system models.
method Hybrid Offline Online Parameter Estimation with Particle Filtering (HOOPE-PF)
result HOOPE-PF outperforms existing methods, especially with small ensemble sizes.

Study shows double descent curve in high-dimensional linear regression with random projections.

problem Understanding the generalization performance in high-dimensional settings with random projections.
method Fixed prediction problem, ridge regression estimator, minimum norm least-squares fit, random matrix theory, asymptotic equivalents.
result Exhibit a double descent curve for high-dimensional linear regression with random projections.

Given any nondegenerate k-dimensional minimal submanifold K of codimension greater than 1, we prove the existence of families of constant mean curvature submanifolds, with mean curvature varying from one member of the family to another, which `condense' to K. In particular, our result proves the existence of constant m…

2004-05-28abs ↗pdf ↗

New framework models non-conservative stochastic processes without energy conservation constraints.

problem Existing Schrödinger Bridge methods are limited by energy-conservation assumptions.
method Introduces non-conservative generalized Schrödinger bridge (NCGSB) based on contact Hamiltonian mechanics.
result Contact Wasserstein geodesic (CWG) provides a broader class of real-world stochastic processes.

Local EGOP learns functions varying along a few directions.

problem Efficient estimation of functions varying along a few directions in high-dimensional space.
method Local EGOP learning, a recursive algorithm using EGOP quadratic form as metric and inverse-covariance.
result Local EGOP learning achieves intrinsic dimensional learning rates under noisy manifold hypothesis.