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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for high conditioning

Neural networks can approximate high-dimensional classifiers with ReLU networks under margin conditions.

problem Approximating high-dimensional discontinuous classifiers with neural networks.
method Using ReLU neural networks with three hidden layers, approximating a classifier with a Barron-regular decision boundary.
result High-dimensional discontinuous classifiers can be approximated with a rate of n1n^{-1} under strong margin conditions.

Unified framework for estimating high-dimensional conditional factor models.

problem Estimating high-dimensional conditional latent factor models with practical limitations.
method Constrained nuclear norm regularization and cross-validation for parameter selection.
result Imposing homogeneity improves model predictability, with new method outperforming alternatives.

Study LASSO for high-dimensional VAR models with weakly dependent innovations.

problem Understanding sparse regularization in high-dimensional VAR models with weakly dependent innovations.
method LASSO estimation for weakly sparse VAR models with heavy tailed innovations, under L1L^1 mixingale condition.
result Oracle properties of LASSO estimation in high-dimensional VAR models with weakly dependent innovations.

Study high-dimensional Bayesian linear regression using variational inference.

problem High-dimensional Bayesian linear regression with product priors.
method Non-linear large deviations theory and variational inference.
result Unique optimizer in variational problem governs posterior distribution under separation condition.

Pontryagin's Maximum Principle is an outstanding result for solving optimal control problems by means of optimizing a specific function on some particular variables, the so called controls. However, this is not always enough for solving all these problems. A high order maximum principle (Krener, 1977) must be used in o…

2012-10-25abs ↗pdf ↗

trVAE improves conditional out-of-sample generation for unpaired data.

problem Challenges in generating high-dimensional samples conditional on low-dimensional descriptors out-of-sample.
method trVAE uses maximum mean discrepancy (MMD) to match distributions across conditions in the decoder layer.
result Improved robustness and accuracy in predicting cellular perturbation responses and disease.

High signal to noise ratio (SNR) consistency of model selection criteria in linear regression models has attracted a lot of attention recently. However, most of the existing literature on high SNR consistency deals with model order selection. Further, the limited literature available on the high SNR consistency of subs…

2017-03-10abs ↗pdf ↗

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

2017-05-28abs ↗pdf ↗

Study uses multi-kernel Hawkes models to analyze high-frequency price dynamics.

problem Understanding responsive speeds of market participants in high-frequency trading.
method Multi-kernel Hawkes models with conditional Hessian analysis for optimization.
result Existence of multi-kernels (UHF, VHF, HF) in high-frequency price dynamics.

New method improves SACOBRA's performance on high-conditioning optimization problems.

problem High-conditioning optimization problems with expensive objective functions.
method Online whitening applied to SACOBRA in the black-box optimization paradigm.
result Online whitening reduces optimization error by a factor of 10 to 1e12 compared to plain SACOBRA.

Unified CI test for categorical and ordinal data maintains power in high dimensions.

problem Rapid degradation of statistical power in existing CI tests for high-dimensional conditioning variables.
method Unified CI test for categorical and ordinal data, maintaining reasonable calibration and power in high dimensions.
result Our test outperforms existing baselines in model testing and structure learning for dense directed graphical models.

FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.

problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.

Paper extends quantile factor analysis with probabilistic methods for better economic policy and financial condition prediction.

problem Improving accuracy in economic and financial condition prediction.
method Probabilistic quantile factor analysis with regularization and variational approximations.
result The probabilistic estimator outperforms a recent loss-based estimator in many cases.

We study high codimension mean curvature flow of a submanifold Mn\mathcal{M}^n of dimension nn in Euclidean space Rn+k\mathbb{R}^{n+k} subject to the quadratic curvature condition A2cnH2,cn=min{43n,1n2} |A|^{2}\leq c_n |H|^{2}, c _n = \min\{ \frac{4}{3n} , \frac{1}{n-2}\}. This condition extends the notion of two-convexity for hypersurface…

2018-05-30abs ↗pdf ↗

Paper develops a high-order recombination algorithm for financial modeling.

problem Creating accurate approximations of stochastic differential equations in finance.
method High-order recombination method applied to practical financial problems.
result Algorithm effectively avoids explosive growth in support cardinality for high-order approximations.

Generative adversarial networks sample unknown high-dimensional conditional distributions.

problem Sampling from unknown high-dimensional conditional distributions with limited data.
method Generative adversarial networks (GAN) for both sampling and distribution inference.
result GAN effectively samples target conditional distribution with minimal impact on sample quality.

AP-CDE uses NF to estimate high-dimensional conditional densities, improving interpretability.

problem Estimating conditional densities for high-dimensional responses like images.
method Extends NF neural networks to handle high-dimensional yy with a latent zz.
result Improves interpretation of latent components, especially zPz_P.

New algorithms improve sampling from complex distributions.

problem Sampling from high-dimensional target distributions with super-linearly growing potentials.
method Proposed aHOLA and aHOLLA algorithms with non-asymptotic convergence bounds.
result Achieved state-of-the-art rates of convergence in non-convex settings.

MAPS algorithm creates reliable prediction intervals for high-dimensional data.

problem Computing reliable conditional prediction intervals in high-dimensional settings.
method Lifted predictive model (LPM) and MAPS algorithm for distribution-free intervals.
result MAPS algorithm produces valid prediction intervals for any trained model.

Efficiently computes optimal transport maps and Wasserstein barycenters using conditional normalizing flows.

problem Computing optimal transport maps and Wasserstein barycenters in high-dimensional spaces.
method Uses conditional normalizing flows to approximate distributions and solve the primal problem.
result Shows computational feasibility for hundreds of input distributions and yields accurate results.

PROD method improves high-dimensional regression by handling strong correlations.

problem Violation of Irrepresentable Condition in LASSO for high-dimensional data.
method PROD procedure based on orthogonal decomposition of design matrix.
result PROD enhances performance of high-dimensional penalized regression.

New method improves simulation efficiency in high dimensions.

problem Efficiency in estimating functionals of conditional expectations in high dimensions.
method Kernel ridge regression exploiting smoothness of conditional expectation.
result Effective reduction of the curse of dimensionality, bridging convergence rates.

Neural framework for conditional OT maps learns from categorical and continuous variables.

problem Learning conditional optimal transport maps between complex distributions.
method Hypernetwork generates adaptive transport layer parameters based on conditioning variables.
result Our method outperforms simpler conditioning methods in comprehensive ablation studies.

Develops a nonparametric graphical model for conditional independence.

problem Evaluation of conditional independence without distributional assumptions.
method Nonlinear sufficient dimension reduction techniques applied to a nonparametric graphical model.
result Method outperforms existing methods in non-Gaussian settings and high-dimensional data.

A new method improves SVI for high-dimensional, poorly-conditioned distributions.

problem Challenges in existing SVI methods for high-dimensional, poorly-conditioned distributions.
method Trust-region optimization approach leveraging conditional independences and second-order information.
result Superior numerical performance and better scalability in high-dimensional distributions.

New method tests CMI using deep neural networks for high-dimensional data.

problem Testing conditional mean independence in high-dimensional settings.
method Population CMI measure and bootstrap-based testing with deep generative neural networks.
result Strong empirical performance and versatility in various scenarios.

The paper analyzes q\ell_q optimization methods for high-dimensional linear regression.

problem Estimating sparse parameters from noisy observations in high-dimensional settings.
method Introduces and analyzes q\ell_q optimization methods for sparse estimation.
result Shows stable recovery properties and bounds for q\ell_q minimization and regularization methods.

Paper proves conditions for estimating precision matrices with Laplacian constraints.

problem Estimating high-dimensional precision matrices with Laplacian constraints.
method Minimizing Stein's loss with conditions on graph connectivity and Laplacian constraints.
result High-dimensional consistency achieved with Laplacian constraints, independent of graph structure.

Modeling implied volatility surface dynamics with Hawkes kernels.

problem Understanding and predicting high-frequency dynamics of the implied volatility surface.
method Hawkes modeling of the volatility surface, with coefficients governing skew and convexity.
result Simple conditions on Hawkes kernel coefficients ensure no-arbitrage and reduce parameter estimation.

New method samples from any causal effect given conditional generative models.

problem Sampling from un/conditional interventional distributions in high-dimensional data.
method Sequence of push-forward computations of conditional generative models.
result Algorithm enables sampling from any identifiable interventional distribution.

We introduce a new framework for training deep generative models for high-dimensional conditional density estimation. The Bottleneck Conditional Density Estimator (BCDE) is a variant of the conditional variational autoencoder (CVAE) that employs layer(s) of stochastic variables as the bottleneck between the input xx a…

2016-11-25abs ↗pdf ↗

Develops a tensor mixture model for high-dimensional data clustering.

problem Jointly modeling and clustering tensors in high dimensions.
method High-dimensional tensor mixture model with plausible dimension reduction assumptions. EHCMA algorithm for efficient estimation.
result The HECM algorithm converges geometrically to a neighborhood within statistical precision of the true parameter.

Given nn i.i.d. observations of a random vector (X,Z)(X,Z), where XX is a high-dimensional vector and ZZ is a low-dimensional index variable, we study the problem of estimating the conditional inverse covariance matrix Ω(z)=(E[(XE[XZ])(XE[XZ])TZ=z])1Ω(z) = (E[(X-E[X \mid Z])(X-E[X \mid Z])^T \mid Z=z])^{-1} under the assumption that the set of non…

2014-12-24abs ↗pdf ↗

Deep learning model predicts material microstructures from processing methods.

problem Linking processing conditions to material properties for material design.
method Conditional image synthesis using Wasserstein GAN with gradient penalty.
result Deep learning model synthesizes high-quality microstructures for given cooling methods.