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

82165247329 · May 202619922001200920172026
48 results for exponential consistency

Paper proposes SLINK clustering for nonparametric data sequences with improved consistency.

problem Nonparametric clustering of data sequences from unknown distributions.
method Exponentially consistent nonparametric SLINK clustering algorithm.
result SLINK clustering achieves exponential consistency under less strict conditions.

AUC (area under ROC curve) is an important evaluation criterion, which has been popularly used in many learning tasks such as class-imbalance learning, cost-sensitive learning, learning to rank, etc. Many learning approaches try to optimize AUC, while owing to the non-convexity and discontinuousness of AUC, almost all …

2012-08-03abs ↗pdf ↗

A nonparametric family of conditional distributions is introduced, which generalizes conditional exponential families using functional parameters in a suitable RKHS. An algorithm is provided for learning the generalized natural parameter, and consistency of the estimator is established in the well specified case. In ex…

2017-11-15abs ↗pdf ↗

Paper explores connections between loss functions and consistency in binary classification and regression.

problem Consistency in binary classification and regression applications.
method Characterization of conformable loss functions and derivation of a new Huber-type loss function.
result Margin-based loss functions are equivalent to loss functions of squared standardized logistic regression residuals.

A function is exponentially concave if its exponential is concave. We consider exponentially concave functions on the unit simplex. In a previous paper we showed that gradient maps of exponentially concave functions provide solutions to a Monge-Kantorovich optimal transport problem and give a better gradient approximat…

2016-05-19abs ↗pdf ↗

Efficiently learns exponential family distributions with i.i.d. samples.

problem Learning natural parameters of truncated exponential families efficiently.
method Proposes a novel loss function and computationally efficient estimator.
result Achieves optimal sample complexity and asymptotic normality.

This technical report proves components consistency for the Doubly Stochastic Dirichlet Process with exponential convergence of posterior probability. We also present the fundamental properties for DSDP as well as inference algorithms. Simulation toy experiment and real-world experiment results for single and multi-clu…

2016-05-24abs ↗pdf ↗

We propose a robust estimator to improve maximum likelihood in probabilistic models.

problem Overfitting and sensitivity to noise in maximum likelihood estimation.
method Distributionally robust maximum likelihood estimator that minimizes worst-case expected log-loss.
result The robust estimator is statistically consistent and performs well in regression and classification tasks.

Analyzing historical data of price indices we find an extraordinary growth phenomenon in several examples of hyper-inflation in which price changes are approximated nicely by double-exponential functions of time. In order to explain such behavior we introduce the general coarse-graining technique in physics, the Monte …

2001-12-24abs ↗pdf ↗

We analyze the data on personal income distribution from the Australian Bureau of Statistics. We compare fits of the data to the exponential, log-normal, and gamma distributions. The exponential function gives a good (albeit not perfect) description of 98% of the population in the lower part of the distribution. The lo…

2006-01-22abs ↗pdf ↗

We consider the problem of rank loss minimization in the setting of multilabel classification, which is usually tackled by means of convex surrogate losses defined on pairs of labels. Very recently, this approach was put into question by a negative result showing that commonly used pairwise surrogate losses, such as ex…

2012-06-27abs ↗pdf ↗

Study optimal stopping times for multi-dimensional processes with non-exponential discounting.

problem Optimal stopping in multi-dimensional processes with non-exponential discounting.
method Probabilistic potential theory to establish existence of optimal equilibria.
result Existence of optimal equilibria for multi-dimensional stopping problems.

The paper extends static Systemic Risk Measures to a conditional setting.

problem Investigating how static Systemic Risk Measures can be adapted to a conditional framework.
method Providing a general dual representation result, analyzing Conditional Shortfall Systemic Risk Measures, and providing explicit formulas for exponential preferences.
result Explicit formulas for Conditional Shortfall Systemic Risk Measures and a time consistency property.

This paper extends exponential smoothing to distributional time series using Wasserstein distance.

problem Forecasting distributional time series with exponential smoothing.
method Generalized exponential smoothing in Wasserstein space, with consistent parameter estimation.
result Wasserstein exponential smoothing outperforms traditional methods in high-frequency financial and electricity demand data.

Given two sets of independent samples from unknown distributions PP and QQ, a two-sample test decides whether to reject the null hypothesis that P=QP=Q. Recent attention has focused on kernel two-sample tests as the test statistics are easy to compute, converge fast, and have low bias with their finite sample estimate…

2018-02-23abs ↗pdf ↗

Space exploration technology advances exponentially, consistent with Moore's and Wright's laws.

problem Predicting the advancement of space exploration technology.
method Analysis of Moore's and Wright's laws applied to space exploration technology.
result Spacecraft technology advances exponentially, consistent with Moore's and Wright's laws.

New algorithm trains deep neural networks without global optimization.

problem Training deep neural networks efficiently and without global optimization.
method Uses random complex exponential activation functions and Markov Chain Monte Carlo sampling.
result Consistently attains theoretical approximation rate for residual networks.

We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup HH. We further assume that HH is not consisting only of lifts with respect to any one covering. Then w…

2014-08-02abs ↗pdf ↗

The matrix completion problem consists in reconstructing a matrix from a sample of entries, possibly observed with noise. A popular class of estimator, known as nuclear norm penalized estimators, are based on minimizing the sum of a data fitting term and a nuclear norm penalization. Here, we investigate the case where …

2015-02-24abs ↗pdf ↗

We investigate a class of hierarchical mixtures-of-experts (HME) models where exponential family regression models with generalized linear mean functions of the form psi(ga+fx^Tfgb) are mixed. Here psi(...) is the inverse link function. Suppose the true response y follows an exponential family regression model with mea…

2013-01-30abs ↗pdf ↗

Utility based methods provide a very general theoretically consistent approach to pricing and hedging of securities in incomplete financial markets. Solving problems in the utility based framework typically involves dynamic programming, which in practise can be difficult to implement. This article presents a Monte Carl…

2002-11-25abs ↗pdf ↗

The study provides error bounds for the generalized Lasso with sub-exponential data.

problem Analyzing the generalized Lasso under sub-exponential data distributions.
method Non-asymptotic analysis using generic chaining-based proof strategy.
result Error bounds for the generalized Lasso can be controlled by two complexity parameters.

In the field of statistics, many kind of divergence functions have been studied as an amount which measures the discrepancy between two probability distributions. In the differential geometrical approach in statistics (information geometry), dually flat spaces play a key role. In a dually flat space, there exist dual a…

2018-08-16abs ↗pdf ↗

In this work, we study the value of an Asian option in the case of exponential Levy markets. More specifically, we are interested in the NIG (normal inverse Gaussian) the VG (variance gamma) models. The exponential Levy models produce incomplete markets. There are therefore an infinite number of equivalent martingale m…

2017-06-05abs ↗pdf ↗

Recent theoretical results establish that time-consistent valuations (i.e. pricing operators) can be created by backward iteration of one-period valuations. In this paper we investigate the continuous-time limits of well-known actuarial premium principles when such backward iteration procedures are applied. We show tha…

2011-09-08abs ↗pdf ↗

Improved GNN simulation of WL test with exponentially lower complexity.

problem Improving the complexity of simulating the Weisfeiler-Lehman test with GNNs.
method Exponentially lower complexity simulation of WL test using GNNs with polylogarithmic parameters and O(log n) bits feature vectors.
result Near-optimal construction with logarithmic lower bounds for feature vector length and neural network size.

The A-polynomial of a manifold whose boundary consists of a single torus is generalised to an eigenvalue variety of a manifold whose boundary consists of a finite number of tori, and the set of strongly detected boundary curves is determined by Bergman's logarithmic limit set, which describes the exponential behaviour …

2003-06-03abs ↗pdf ↗

Develops Aleksandrov reflection for hyperbolic flows, proving convergence to umbilic surfaces.

problem Analyzing geometric flows in hyperbolic spaces.
method Aleksandrov reflection framework applied to level-set formulation, with graphical and Lipschitz estimates.
result Solutions converge exponentially fast to an umbilic hypersurface at infinity.