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

Trend · papers per month

143286429572 · Jun 202019922001200920172026
48 results for orthogonal distributions

The paper proves integral formulas for manifolds with multiple orthogonal distributions.

problem Understanding geometric properties of manifolds with multiple orthogonal distributions.
method Develops integral formulas for Riemannian manifolds with k>2k>2 orthogonal complementary distributions.
result Generalizes known formulas for k=2k=2 and applies to manifold splitting and immersions.

Proposes FOAGP for efficient orthogonal effect decomposition of black-box computer experiments.

problem Challenges in sensitivity analysis of black-box computer experiments with complex, nonlinear functional outputs.
method Functional-output orthogonal additive Gaussian process (FOAGP) with conditional orthogonality constraint.
result Demonstrates effectiveness in orthogonal effect decomposition and variance decomposition through simulations and real-world application.

Novel prior for orthogonal functions improves functional component estimation.

problem Improving orthogonality in functional principal component analysis.
method Sequential adaptive priors for orthogonal functions using hierarchical conditionally normal distributions.
result Proposed prior leads to nearly orthogonal posterior estimates.

We study conditions for the integrability of the distribution defined on a regular Poisson manifold as the orthogonal complement (with respect to some (pseudo)-Riemannian metric) to the tangent spaces of the leaves of a symplectic foliation. Examples of integrability and non-integrability of this distribution are provi…

2004-05-08abs ↗pdf ↗

EigenVI uses orthogonal function expansions for efficient variational inference.

problem Efficiently approximate complex distributions in variational inference.
method EigenVI constructs variational approximations using orthogonal function expansions, minimizing Fisher divergence.
result EigenVI provides more accurate approximations than existing methods for Gaussian BBVI.

This work proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

problem Proving the asymptotic freeness of layerwise Jacobians in multilayer perceptrons (MLPs).
method Replacing each layer's parameter matrix with itself multiplied by a Haar orthogonal matrix, and using the invariance of the MLP.
result Proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

We consider the problem of sampling from posterior distributions for Bayesian models where some parameters are restricted to be orthogonal matrices. Such matrices are sometimes used in neural networks models for reasons of regularization and stabilization of training procedures, and also can parameterize matrices of bo…

2019-01-23abs ↗pdf ↗

Paper introduces GDR-learners for estimating potential outcomes from observational data.

problem Lack of theoretical property of general Neyman-orthogonality in deep generative models.
method Develops flexible GDR-learners based on various deep generative models.
result GDR-learners possess quasi-oracle efficiency and rate double robustness, asymptotically optimal.

Local classification of 4D Ricci solitons with specific algebra properties.

problem Classifying 4D Ricci solitons with a 2D Abelian Killing algebra.
method Local classification under specific curvature and symmetry conditions.
result Classification of Ricci solitons with orthogonally intransitive 2D Abelian Killing algebra.

LOFT separates subspace rotation and transformation for orthogonal fine-tuning.

problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.

Double machine learning provides n\sqrt{n}-consistent estimates of parameters of interest even when high-dimensional or nonparametric nuisance parameters are estimated at an n1/4n^{-1/4} rate. The key is to employ Neyman-orthogonal moment equations which are first-order insensitive to perturbations in the nuisance param…

2017-11-01abs ↗pdf ↗

Distributed-OMP recovers sparse vectors with low communication costs.

problem High-dimensional sparse linear regression with limited computation and communication.
method Distributed orthogonal matching pursuit (OMP) scheme.
result Support of the regression vector can be recovered with linear communication per machine and logarithmic in dimension.

A method for interpreting SVMs using polynomial kernels, revealing model complexity.

problem Interpreting SVMs built with truncated orthogonal polynomial kernels.
method Orthogonal Representation Contribution Analysis (ORCA) with normalized Orthogonal Kernel Contribution (OKC) indices.
result The method reveals structural aspects of model complexity not captured by predictive accuracy.

New algorithm tackles optimization with distributed constraints.

problem Optimization problems with generalized orthogonality constraints in a decentralized setting.
method Introduced a novel algorithm that tracks gradients and Jacobians simultaneously.
result Global convergence with an iteration complexity established.

The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.

problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.

In this paper we derive a series expansion for the price of a continuously sampled arithmetic Asian option in the Black-Scholes setting. The expansion is based on polynomials that are orthogonal with respect to the log-normal distribution. All terms in the series are fully explicit and no numerical integration nor any …

2018-02-05abs ↗pdf ↗

Random matrix ensembles yield uniform distributions on manifolds.

problem Understanding distributions of vectors in random matrix ensembles.
method Analyzing eigenvalues, singular values, and Autonne-Takagi vectors of various random matrix ensembles.
result Uniform distributions on specific manifolds for different types of random matrix ensembles.

New ONMF model minimizes KL divergence for better sparse data modeling.

problem Clustering and data modeling with sparse vectors.
method Developed KL-ONMF algorithm based on alternating optimization.
result KL-ONMF outperforms Frobenius-norm ONMF for document classification and hyperspectral image unmixing.

P-OCS detects OOD samples in a low-dimensional subspace, outperforming existing methods.

problem Efficient OOD detection for deep learning models in open-world environments.
method P-OCS operates in the orthogonal complement of the principal subspace, applying a single projected perturbation.
result P-OCS achieves state-of-the-art OOD detection with negligible computational cost and without requiring model retraining.

Estimates treatment effects in randomized experiments with non-compliance.

problem Estimating distributional treatment effects in experiments with imperfect compliance.
method Proposes a regression-adjusted estimator based on distribution regression with Neyman-orthogonal moment conditions.
result Achieves semiparametric efficiency bound and demonstrates favorable performance in simulations and real data.

OPAA estimates probability densities using functional analysis.

problem Estimating probability density functions efficiently and accurately.
method OPAA uses a parallelizable algorithm based on functional analysis to estimate probability distributions.
result OPAA provides an efficient method to estimate probability density functions and normalizing weights.

The paper explores how semantic independence can be captured in text embeddings using partial orthogonality.

problem Capturing semantic independence in text embeddings.
method Developed a theory and methods based on partial orthogonality to demonstrate semantic independence.
result Partial orthogonality captures semantic independence in text embeddings.

SOFARI improves inference on multi-task learning latent factors.

problem Challenges in precise inference on multi-task learning latent factor matrices.
method High-dimensional manifold-based Neyman near-orthogonality inference on Stiefel manifold structure.
result Easy-to-use bias-corrected estimators for latent factor vectors and singular values with asymptotic normal distributions.

Over-parameterized models reduce Out-of-Distribution (OOD) generalization loss.

problem Understanding how over-parameterized models handle non-trivial distributional shifts.
method Investigating random feature models and examining non-trivial natural distributional shifts.
result Increasing model parameterization reduces OOD loss.

Optimal spectral estimators and AMP combine for efficient weak recovery in orthogonally invariant GLMs.

problem Parameter estimation from generalized linear models with complex correlation structures.
method Spectral initialization and approximate message passing (AMP) algorithm.
result Established rigorous performance guarantees for spectral initialization and AMP.

We study the distribution of the adaptive LASSO estimator (Zou (2006)) in finite samples as well as in the large-sample limit. The large-sample distributions are derived both for the case where the adaptive LASSO estimator is tuned to perform conservative model selection as well as for the case where the tuning results…

2008-01-30abs ↗pdf ↗

We consider the Orthogonal Least-Squares (OLS) algorithm for the recovery of a mm-dimensional kk-sparse signal from a low number of noisy linear measurements. The Exact Recovery Condition (ERC) in bounded noisy scenario is established for OLS under certain condition on nonzero elements of the signal. The new result a…

2016-08-08abs ↗pdf ↗

We relate the distribution of eigenvalues of a random symmetric matrix in the Gaussian Orthogonal Ensemble to the distribution of critical values of a random linear combination of eigenfunctions of the Laplacian on a compact Riemann manifold. We then prove a central limit theorem describing what happens when the dimens…

2012-01-24abs ↗pdf ↗

Deep networks with orthogonal weights show stable fluctuations, improving generalization and training speed.

problem Fluctuations in deep networks with Gaussian weights can impair training, especially in networks with depth comparable to width.
method Analytical and numerical studies of fully-connected networks with orthogonal weight initialization and tanh activations.
result Rectangular networks with orthogonal weights have stable fluctuations independent of network depth, leading to better generalization and training speed.

Introduces CSLC models to bridge deep generative models and classical algorithms.

problem Mode collapse and memorization issues in deep generative models and restrictive assumptions in classical algorithms.
method Introduces conditionally strongly log-concave (CSLC) models, factorizing data distribution into strongly log-concave conditional distributions.
result Efficient parameter estimation and sampling algorithms with theoretical guarantees for non-log-concave data distributions.

This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a…

2009-08-31abs ↗pdf ↗

The study extends Jacobi-orthogonality to indefinite scalar product spaces.

problem Generalizing Jacobi-orthogonality to indefinite scalar product spaces.
method Comparing principles, investigating tensor relations, proving properties.
result Every quasi-Clifford tensor is Jacobi-orthogonal; certain tensors are Jacobi-dual or Osserman.

OMIC improves matrix completion with orthonormal side information and nuclear-norm regularization.

problem Matrix completion with improved interpretability and adaptability.
method OMIC combines orthonormal side information and nuclear-norm regularization, optimized by a converging algorithm.
result OMIC outperforms state-of-the-art methods in synthetic and real-world datasets.