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

Trend · papers per month

79157236314 · Jun 202019922001200920172026
48 results for statistical version

The paper introduces a statistical version of contact CR-product for Sasakian statistical manifolds.

problem Characterizing geometric properties of contact CR-submanifolds in Sasakian statistical manifolds.
method Characterization of integrability of invariant and anti-invariant distributions, development of results on specific types of contact CR submanifolds, introduction of statistical contact CR-product.
result Introduction of a statistical version of contact CR-product for Sasakian statistical manifolds.

As regulators pay more attentions to losses rather than gains, we are able to derive a new class of risk statistics, named regulator-based risk statistics with scenario analysis in this paper. This new class of risk statistics can be considered as a kind of risk extension of risk statistics introduced by Kou et al. \ci…

2019-04-16abs ↗pdf ↗

A version of indifference valuation of a European call option is proposed that includes statistical regularities of nonstochastic randomness. Classical relations (forward contract value and Black-Scholes formula) are obtained as particular cases. We show that in the general case of nonstochastic randomness the minimal …

2010-06-13abs ↗pdf ↗

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

New statistics are introduced that maintain the Fisher metric structure closely, akin to sufficient statistics.

problem Maintaining the Fisher metric structure in statistical models.
method Characterizing statistics that maintain the Fisher metric structure bi-Lipschitz equivalently.
result Characterized statistics that preserve the Fisher metric structure closely.

Develops unbiased estimation method using underdamped Langevin dynamics.

problem Estimating expectations of non-negative Lebesgue density probability measures.
method Underdamped Langevin dynamics, time-discretized versions, doubly randomized estimation.
result Proves finite variance and expected/finite cost of the proposed estimator.

New algorithm balances user reward and statistical inference by mixing TS with UR based on difference size.

problem Combining statistical inference with user reward in adaptive experiments.
method TS-PostDiff algorithm that uses UR when differences are small and TS when large.
result TS-PostDiff reduces false positives and increases statistical power for small differences, while maximizing reward for large ones.

Novel nonparametric method for GLMs improves prediction and inference performance.

problem Improving prediction and inference in GLMs with minimal assumptions.
method Combines binary regression and latent variable formulations, extends parametric versions, introduces new classification statistic.
result Uniformly better prediction and inference performance over parametric formulation, especially with asymmetric data.

Improved GoF statistics using entropy-regularized optimal transport for multivariate rank.

problem Developing efficient multivariate rank statistics for statistical testing and generative modeling.
method Entropy-regularized optimal transport maps to address computational and sample complexity issues.
result Proposed soft rank energy and maximum mean discrepancy achieve fast convergence rates and are differentiable.

We introduce a mean-field type approximation for description of company's income statistics. Utilizing huge company data we show that a discrete version of Langevin equation with additive and multiplicative noises can appropriately describe the time evolution of a company's income fluctuation in statistical sense. The …

2003-07-11abs ↗pdf ↗

This paper studies statistical estimation in optional regression models.

problem Estimating parameters in regression models with optional semimartingale processes.
method Structural least squares (LS) estimates and their sequential versions.
result Strong consistency of LS-estimates and fixed accuracy of sequential LS-estimates.

Chentsov's theorem characterizes the Fisher information metric on statistical models as essentially the only Riemannian metric that is invariant under sufficient statistics. This implies that each statistical model is naturally equipped with a geometry, so Chentsov's theorem explains why many statistical properties can…

2017-01-31abs ↗pdf ↗

Methods for analysis of principal components in discrete data have existed for some time under various names such as grade of membership modelling, probabilistic latent semantic analysis, and genotype inference with admixture. In this paper we explore a number of extensions to the common theory, and present some applic…

2012-07-11abs ↗pdf ↗

The study provides statistical guarantees for Bayesian variational boosting.

problem Statistical and convergence issues in variational boosting.
method Proposed a novel variational family and a functional Frank-Wolfe optimization algorithm.
result Demonstrated stochastic boundedness and provided convergence rate for boosting iterates.

Closed-form flow matching yields similar performance to stochastic version, improving model performance.

problem Understanding why flow matching models generalize well.
method Empirical analysis and comparison of stochastic and closed-form flow matching losses.
result Closed-form flow matching can improve model performance.

Paper optimizes statistical estimation for randomized smoothing to reduce adversarial robustness certification time.

problem Efficiently estimating robustness of points against adversarial attacks.
method Developed estimation procedures using confidence sequences and randomized Clopper-Pearson intervals.
result Achieved optimal sample complexities and stronger certificates with reduced computational burden.

Using methods introduced by Scargle in 1978 we derive a cumulative version of the Lomb periodogram that exhibits frequency independent statistics when applied to cumulative noise. We show how this cumulative Lomb periodogram allows us to estimate the significance of log-periodic signatures in the S&P 500 anti-bubble th…

2003-02-25abs ↗pdf ↗

Quantum probability theory reveals hidden structure in joint probability distributions.

problem Understanding hidden structure in joint probability distributions.
method Modeling joint probability distributions as density operators and applying partial trace.
result Decoding extra information in reduced density operators that captures subsystem interactions.

This paper is concerned with the study of constrained statistical learning problems, the unconstrained version of which are at the core of virtually all of modern information processing. Accounting for constraints, however, is paramount to incorporate prior knowledge and impose desired structural and statistical proper…

2020-02-12abs ↗pdf ↗

Study aggregation of statistical evidence under unknown dependence using group-invariance.

problem Aggregating statistical evidence under unknown and complex dependence structures.
method Develops a framework using group-invariance and permutation-based constructions to aggregate evidence across transformed datasets.
result Shows uniform improvement in critical values for single-batch aggregation over deterministic calibrations, adapting to unknown dependence structures.

We consider the question of learning in general topological vector spaces. By exploiting known (or parametrized) covariance structures, our Main Theorem demonstrates that any continuous linear map corresponds to a certain isomorphism of embedded Hilbert spaces. By inverting this isomorphism and extending continuously, …

2014-05-01abs ↗pdf ↗

The paper explores quantum statistical manifolds and their autoparallelity, providing estimation-theoretical characterizations.

problem Quantum statistical manifolds and their geometric properties.
method Study of autoparallelity w.r.t. the e-connection, using quantum estimation theory.
result Characterizations of e-autoparallel submanifolds as statistical models with efficient estimators.

Paper explores Elliptical Wishart distributions in signal processing and machine learning.

problem Estimating parameters of Elliptical Wishart distributions.
method Proposes fixed point and Riemannian optimization algorithms for maximum likelihood estimation.
result Characterizes existence, uniqueness, and convergence of the MLE.

The rectified flow method is analyzed for its statistical properties.

problem Theoretical support for rectified flow methods is lacking.
method Empirical analysis of rectified flow's statistical properties using regression and density estimation.
result Convergence rates for rectified flow estimators are faster than for nonparametric regression and density estimation.

AOBTM adapts online topic modeling for short app reviews, revealing coherent topics over time.

problem Challenges in inferring latent topics from short, dynamic app reviews over multiple versions.
method Adaptive Online Biterm Topic Model (AOBTM) that addresses sparsity and considers statistical data from previous versions.
result AOBTM finds more coherent topics and outperforms state-of-the-art baselines.

A new dynamical formulation of log-PCA captures local principal modes of geodesic variations.

problem Learning principal variations of random probability measures under Wasserstein geometry.
method Introducing a new dynamical formulation of log-PCA as a variational approach.
result Deriving a general statistical convergence rate for empirical WT-PCA.

Improved estimation of higher order integrals using shrinkage techniques.

problem Estimating higher order Bochner integrals in non-parametric settings.
method Shrinkage of U-statistic towards a target element, considering kernel degeneracy.
result Consistent shrinkage estimators with fast rates of convergence, even for non-degenerate kernels.

The study improves the assessment of fairness in face recognition using ROC curves and statistical guarantees.

problem Improving the assessment of fairness in face recognition systems.
method Proves asymptotic guarantees for empirical ROC curves and fairness metrics, and introduces a recentering technique to avoid bootstrap pitfalls.
result Demonstrates the practical relevance of the methods for assessing fairness in face recognition systems.

New normalization method makes neural networks more robust to adversarial attacks.

problem Adversarial vulnerability of BatchNorm in deep neural networks.
method Identified distribution shift caused by adversarial images, proposed RobustNorm to use inference-time statistics.
result RobustNorm makes models more robust to adversarial attacks without sacrificing BatchNorm benefits.

Improved likelihood-free inference using preconditioned neural posterior estimation.

problem Inaccurate posterior estimation in likelihood-free inference methods.
method Preconditioned Neural Posterior Estimation (PNPE) and Sequential PNPE (PSNPE) methods.
result PNPE and PSNPE improve posterior estimation accuracy over NPE and SNPE.