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

152304456608 · Jun 202019922001200920172026
48 results for statistical information

We review basic notions in the field of information geometry such as Fisher metric on statistical manifold, αα-connection and corresponding curvature following Amari's work . We show application of information geometry to asymptotic statistical inference.

2014-10-09abs ↗pdf ↗

This work uses statistical mechanics to explain AI learning.

problem Understanding the statistical principles behind AI learning.
method Starting from sample concentration behaviors, the study applies statistical mechanics principles to AI and machine learning.
result Exponential families and statistical quantities are key in AI and machine learning.

Paper develops error rates for physics-informed learning, comparing it to data-driven methods.

problem Understanding the trade-off between soft penalties and hard constraints in PISL.
method Develops complexity-dependent error rates using the small-ball method.
result Physics-informed estimators have comparable error rates to hard constrained methods, differing only by constants.

Develops information geometry for Lévy processes in finance.

problem Understanding the statistical properties of Lévy processes for financial modeling.
method Deriving α\alpha-divergences from Lévy triplets, identifying Fisher information matrix and α\alpha-connection.
result Identifies statistical implications and differential-geometric structures of Lévy processes.

Researchers study the geometric properties of a specific type of stable processes.

problem Understanding the information geometry of tempered stable processes.
method Derivation of α-divergence, Fisher information matrices, and α-connections.
result Obtained Fisher information matrices and α-connections for statistical manifolds.

Information geometry provides a geometric approach to families of statistical models. The key geometric structures are the Fisher quadratic form and the Amari-Chentsov tensor. In statistics, the notion of sufficient statistic expresses the criterion for passing from one model to another without loss of information. Thi…

2012-07-28abs ↗pdf ↗

Paper discusses the Fisher metric and differentiability in statistical models.

problem Understanding the relationship between Fisher metric and differentiability in statistical models.
method Comparison of different concepts and models in Information Geometry, mathematical statistics, and measure theory.
result Discussion of various models and their differentiability properties.

New method uses sufficient statistics to infer causal relationships from observational data.

problem Inferring causal relationships from observational data with hidden variables.
method Information Bottleneck method applied to find functional sufficient statistics.
result New causal rules not obtainable from standard methods, validated on simulated and real data.

We simplify information measure computation using learned features.

problem Computing information measures from raw data is computationally expensive.
method Developed a separable design for computing information measures from learned feature representations.
result A variety of information measures can be computed efficiently through learned feature representations.

The paper optimizes private data sharing by selecting statistics and using MCMC for Bayesian inference.

problem Optimizing private data sharing by selecting statistics and performing Bayesian inference.
method Promotes Fisher information for statistic selection and proposes MCMC algorithms for inference.
result The Fisher information of the privatized statistic predicts the relative performance of the statistic in Bayesian estimation.

Improved computational complexity in statistical models using second-order information.

problem Polynomial convergence of gradient descent in singular statistical models.
method Normalized Gradient Descent (NormGD) algorithm with second-order information.
result NormGD reaches final statistical radius in logarithmic iterations of nn.

New measures generalize existing ones, linking information and risk.

problem Linking information measures and risk in statistical decision problems.
method Introducing new families of divergence measures and deriving an information processing equality.
result Extension of variational φφ-divergence representation to multiple distributions.

New quantum states capture more information, enabling advanced processing tasks.

problem Quantum information processing challenges with limited statistical information.
method Introducing Random-Coefficient Pure States (RCPS) and exploiting their higher-order statistics.
result RCPS provide richer information than density operators, enabling new quantum tasks.

Solla discusses neural processing using statistical physics and Bayesian methods.

problem Understanding neural information processing through statistical physics.
method Bayesian inference, Gibbs description, Generalized Linear Models, dimensionality reduction.
result Connection between neural processing and statistical physics.

New method detects information leakage using approximate Bayes predictor.

problem Unintentional exposure of sensitive information via observable data.
method Statistical learning theory and information theory framework, approximating Bayes predictor's log-loss and accuracy.
result MI can be accurately estimated to detect ILs, outperforming state-of-the-art baselines.

We introduce Minimal Achievable Sufficient Statistic (MASS) Learning, a training method for machine learning models that attempts to produce minimal sufficient statistics with respect to a class of functions (e.g. deep networks) being optimized over. In deriving MASS Learning, we also introduce Conserved Differential I…

2019-05-19abs ↗pdf ↗

CuBAS selects informative data points based on curvature for better classification.

problem Lack of efficient sampling strategies for maximizing dataset informativeness.
method Information-geometric framework using curvature scores to select labeled data.
result Consistent and statistically significant improvements over random and uncertainty-based sampling.

Study excess risk in statistical inference with transformations.

problem Excess risk in estimating random variables from feature vectors and transformations.
method Characterize lossless transformations, develop test statistics, and information-theoretic bounds.
result Strongly consistent partitioning test statistic for lossless transformations.

Constructing exponential families from statistical manifolds.

problem The central problem of constructing exponential families from statistical manifolds.
method Constructive approach proving every compact statistical manifold admits a foliation of Hessian manifolds.
result Compact orientable leaves are either finite quotients of flat torus or mapping torus with periodic monodromy.

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as the length of the shortest program producing it. The second, Shannon information…

2011-10-17abs ↗pdf ↗

Study information geometry of warped product spaces, finding special connections.

problem Understanding information geometry in warped product spaces.
method Examined warped products with dually flat connections, characterized connections on base space.
result Characterized connections on base space R>0\mathbb{R}_{>0} as αα-connections with α=±1α= \pm{1}.

A statistical model or a learning machine is called regular if the map taking a parameter to a probability distribution is one-to-one and if its Fisher information matrix is always positive definite. If otherwise, it is called singular. In regular statistical models, the Bayes free energy, which is defined by the minus…

2012-08-31abs ↗pdf ↗

The paper proposes using Autoencoders to learn summary statistics for Bayesian inference.

problem Approximating posterior distributions for models with intractable likelihood functions.
method Using Autoencoders to extract summary statistics that retain parameter information and cancel noise.
result The approach effectively learns summary statistics that improve posterior approximation.

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

Value functions struggle to represent transition dynamics, impacting statistical efficiency.

problem Limited representational power of value functions in capturing transition dynamics.
method Case studies of various reinforcement learning problems to explore the limitations of value-based methods.
result Value-based methods can be as efficient as model-based ones in some cases but severely underperform in others due to information loss.

Study compares cryptocurrency and stock markets using statistical equilibrium models.

problem Comparing the stochastic structure of cryptocurrency and stock markets.
method Applied QRSE model to analyze daily returns of cryptocurrencies and S&P 500 companies.
result Revealed differences in informational efficiency between cryptocurrency and stock markets.

This report concerns the problem of dimensionality reduction through information geometric methods on statistical manifolds. While there has been considerable work recently presented regarding dimensionality reduction for the purposes of learning tasks such as classification, clustering, and visualization, these method…

2008-09-29abs ↗pdf ↗

Investigates financial and economic systems using statistical mechanics and information theory.

problem Complexity, asymmetry, stochasticity, and non-linearity in financial and economic systems.
method Model-based and empirical analyses using statistical mechanics and information theory.
result Derives probability distribution functions for better understanding of financial and economic dynamics.