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

111222333444 · Jun 202019922001200920172026
48 results for non-negative random variables

New method for inference on covariates in NMF with random effects.

problem Formal inference for covariate effects in NMF with non-negativity constraints.
method NMF-RE model with random effects, ridge updates, df-based cap, asymptotic linearization, wild bootstrap.
result Valid inference on covariates with non-negativity constraint, avoiding degeneracy.

Stochastic gradient Langevin dynamics (SGLD) is a computationally efficient sampler for Bayesian posterior inference given a large scale dataset. Although SGLD is designed for unbounded random variables, many practical models incorporate variables with boundaries such as non-negative ones or those in a finite interval.…

2019-03-07abs ↗pdf ↗

A new method for decomposing non-negative tensors using energy-based modeling.

problem Challenges in traditional tensor decomposition methods, especially global optimization and rank selection.
method Energy-based modeling of tensors, considering interactions between modes for global optimization.
result Demonstrates effectiveness in tensor completion and approximation, revealing a relationship between many-body and low-rank approximations.

Paper proposes robust risk measures for non-negative risks with partial information.

problem Tackles robustness of distortion risk measures under distributional uncertainty.
method Introduces new uncertainty sets and derives closed-form expressions for risk maximization.
result Derives closed-form expressions for risk maximization over uncertainty sets.

Graphs with bounded degrees and non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk.

problem Understanding geometric properties of graphs with non-negative Ollivier-Ricci curvature.
method Analyzing the geometric properties of graphs with non-negative Ollivier-Ricci curvature, proving subexponential growth and diffusive random walk.
result For graphs with bounded degrees and non-negative Ollivier-Ricci curvature, the average log-volume growth and random walk displacement are subexponential.

Paper generalizes tensor-train approximation for complex random variables.

problem Characterizing intractable high-dimensional random variables.
method Extends inverse Rosenblatt transform to general reference measures and integrates into deep variable transformation framework.
result Deep inverse Rosenblatt transport significantly expands tensor approximations for complex random variables.

Let Xλ1,,Xλn X_{λ_1},\ldots,X_{λ_n} be dependent non-negative random variables and Yi=IpiXλiY_i=I_{p_i} X_{λ_i}, i=1,,ni=1,\ldots,n, where Ip1,,IpnI_{p_1},\ldots,I_{p_n} are independent Bernoulli random variables independent of XλiX_{λ_i}'s, with E[Ipi]=pi{\rm E}[I_{p_i}]=p_i, i=1,,ni=1,\ldots,n. In actuarial sciences, YiY_i corresponds to the claim amo…

2018-12-14abs ↗pdf ↗

This paper introduces Schur-constant equilibrium distribution models of dimension n for arithmetic non-negative random variables. Such a model is defined through the (several orders) equilibrium distributions of a univariate survival function. First, the bivariate case is considered and analyzed in depth, stressing the…

2017-09-28abs ↗pdf ↗

Let Xλ1,,Xλn X_{λ_1},\ldots,X_{λ_n} be a set of dependent and non-negative random variables share a survival copula and let Yi=IpiXλiY_i= I_{p_i}X_{λ_i}, i=1,,ni=1,\ldots,n, where Ip1,,IpnI_{p_1},\ldots,I_{p_n} be independent Bernoulli random variables independent of XλiX_{λ_i}'s, with E[Ipi]=pi{\rm E}[I_{p_i}]=p_i, i=1,,ni=1,\ldots,n. In actuarial scie…

2018-12-14abs ↗pdf ↗

Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.

problem Understanding the relationship between graph curvature and expansion properties.
method Proving an inequality linking isoperimetric profiles to total variation decay of random walks.
result Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.

We formulate and solve a tensor model using a latent-variable approach.

problem Parameter inference for Poisson canonical polyadic tensor models.
method Latent-variable formulation, Expectation-Maximization algorithms, Fisher information matrices.
result Derivation of Fisher information for PCP models, insights into model well-posedness.

Improved neural network model for predicting latent budgets in compositional data.

problem Predicting response variables in compositional data with non-negativity constraints.
method LBA-NN, a feed forward neural network model that incorporates K-means clustering for interpretation.
result LBA-NN outperforms traditional LBA in prediction accuracy, specificity, recall, and mean square error.

Model place cells as spatial embeddings for efficient path planning and cognitive map construction.

problem Encoding spatial navigation in the hippocampus.
method Model place cells using spectral decomposition of multi-step random walk transition kernels, inducing sparsity and adjacency.
result Place cells encode spatial information through non-negativity and inner-product structure, forming a cognitive map.

We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order methods: (1) they allow using two different extrapolation points to evaluate the grad…

2019-03-05abs ↗pdf ↗

Study of deep neural networks with dependent weights leading to new model limits and properties.

problem Characterizing deep neural networks with dependent weights in the infinite-width limit.
method Modeling weights as a mixture of Gaussian distributions and analyzing the infinite-width limit.
result Characterization of neural network layers by scalar parameters and Lévy measures, leading to new model limits.

The paper introduces submodular information measures for machine learning applications.

problem Generalizing information-theoretic measures to non-random variables.
method Developing combinatorial information measures based on submodular functions.
result Submodular mutual information is submodular in one argument for certain submodular functions.

In this paper, we propose a variable selection method for general nonparametric kernel-based estimation. The proposed method consists of two-stage estimation: (1) construct a consistent estimator of the target function, (2) approximate the estimator using a few variables by l1-type penalized estimation. We see that the…

2018-06-02abs ↗pdf ↗

Sharp concentration results for sums of heavy-tailed random variables.

problem Analyzing sums of independent heavy-tailed random variables.
method Using concentration inequalities and large deviation principles for distributions satisfying specific tail bounds.
result Sharp concentration inequalities and large deviation results for sums of heavy-tailed random variables.

We offer mathematical tractability and new insights for a framework of exponential utility with non-negative consumption, a constraint often omitted in the literature giving rise to economically unviable solutions. Specifically, using the Kuhn-Tucker theorem and the notion of aggregate state price density (Malamud and …

2011-06-15abs ↗pdf ↗

Paper extends stochastic dominance for compound binomial distributions.

problem Stochastic dominance for infinite-mean random variables.
method Investigates properties and inclusion relationships of distribution classes, extends results to compound binomial distributions.
result Establishes necessary and sufficient conditions for first-order stochastic dominance preservation.

We define a hybrid between Ollvier and Bakry Emery curvature on graphs with dependence on a variable neighborhood. The hexagonal lattice is non-negatively curved under this new curvature notion. Bonnet-Myers diameter bounds and Lichnerowicz eigenvalue estimates follow from the standard arguments. We prove gradient esti…

2019-06-14abs ↗pdf ↗

New class of heavy-tailed distributions shows weighted averages dominate individual variables.

problem Understanding and comparing risks in heavy-tailed distributions.
method Introducing a new class of heavy-tailed distributions and proving stochastic dominance relations.
result Weighted averages of random variables in this class are stochastically larger than individual variables.

Consider an experiment involving a potentially small number of subjects. Some random variables are observed on each subject: a high-dimensional one called the "observed" random variable, and a one-dimensional one called the "outcome" random variable. We are interested in the dependencies between the observed random var…

2018-06-13abs ↗pdf ↗

The likelihood model of high dimensional data XnX_n can often be expressed as p(XnZn,θ)p(X_n|Z_n,θ), where θ:=(θk)k[K]θ\mathrel{\mathop:}=(θ_k)_{k\in[K]} is a collection of hidden features shared across objects, indexed by nn, and ZnZ_n is a non-negative factor loading vector with KK entries where ZnkZ_{nk} indicates the strength of …

2019-05-09abs ↗pdf ↗

The paper sets limits on the accuracy of macroeconomic forecasts based on statistical moments and trade volumes.

problem Uncertainty in predicting macroeconomic variables like prices and returns.
method Defines theoretical lower bounds of uncertainty and upper limits on forecast accuracy based on statistical moments and trade volumes.
result Accuracy of forecasts of probabilities of macroeconomic variables doesn't exceed Gaussian approximations.

Non-negative matrix factorization (NMF) approximates a non-negative matrix XX by a product of two non-negative low-rank factor matrices WW and HH. NMF and its extensions minimize either the Kullback-Leibler divergence or the Euclidean distance between XX and WTHW^T H to model the Poisson noise or the Gaussian noise.…

2012-07-14abs ↗pdf ↗

This study compares machine learning methods for high-cardinality categorical variables.

problem Machine learning struggles with high-cardinality categorical variables.
method Empirical comparison of tree-boosting, deep neural networks, and linear mixed effects models.
result Tree-boosting with random effects outperforms deep neural networks with random effects.

Random Forest variable importance is improved by class balancing techniques.

problem Class imbalance problem in machine learning.
method Proposed a variable selection algorithm using RF variable importance and its confidence interval.
result Our algorithm efficiently selects an optimal feature set, leading to improved prediction performance.

This paper examines from an experimental perspective random forests, the increasingly used statistical method for classification and regression problems introduced by Leo Breiman in 2001. It first aims at confirming, known but sparse, advice for using random forests and at proposing some complementary remarks for both …

2008-11-21abs ↗pdf ↗