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

6121824 · May 202619922001200920172026
48 results for Fisher null-space

The paper proposes a novel MKL approach for OCC using p\ell_p-norm constraints.

problem Addressing the MKL problem for one-class classification.
method A min-max saddle point Lagrangian optimisation problem is formulated and solved efficiently.
result The proposed method outperforms baselines and other algorithms on various data sets.

ZDP detects drift in large language models without labels, proving key theorems and metrics.

problem Detecting drift in large language models without task labels or output evaluations.
method Zero-Direction Probing (ZDP) framework based on null directions of transformer activations, proving theoretical guarantees.
result Proves the Variance--Leak Theorem, Fisher Null-Conservation, Rank--Leak bound, and logarithmic-regret guarantee.

The kernel null-space technique and its regression-based formulation (called one-class kernel spectral regression, a.k.a. OC-KSR) is known to be an effective and computationally attractive one-class classification framework. Despite its outstanding performance, the applicability of kernel null-space method is limited d…

2019-02-06abs ↗pdf ↗

The one-class kernel spectral regression (OC-KSR), the regression-based formulation of the kernel null-space approach has been found to be an effective Fisher criterion-based methodology for one-class classification (OCC), achieving state-of-the-art performance in one-class classification while providing relatively hig…

2019-05-22abs ↗pdf ↗

Researchers use information geometry to analyze and improve DRWs for node classification.

problem Lack of theoretical foundations for Discriminative Random Walks (DRWs).
method Revisit DRWs through information geometry, treating hitting-time laws as a statistical manifold. Derived closed-form expressions and introduced sensitivity scores.
result Introduced a sensitivity score that bounds maximal first-order change in DRW betweenness under unit Fisher perturbations.

New findings on curvature and null spaces of Laplacians.

problem Relationship between sectional curvature and Laplacian null spaces.
method Analysis of curvature operators and Laplacians on Riemannian manifolds.
result Curvature operator's positivity implies sectional curvature positivity.

Bayesian deep learning avoids underfitting by projecting onto null space of generalized Gauss-Newton matrix.

problem Bayesian deep learning often underfits, leading to less accurate predictions than point estimates.
method Proposes a matrix-free algorithm to project onto the null space of the generalized Gauss-Newton matrix, ensuring Bayesian predictions do not underfit.
result The method scales to large models, including vision transformers with 28 million parameters, and avoids underfitting.

In this paper, we carry out null space analysis for Class-Specific Discriminant Analysis (CSDA) and formulate a number of solutions based on the analysis. We analyze both theoretically and experimentally the significance of each algorithmic step. The innate subspace dimensionality resulting from the proposed solutions …

2019-08-13abs ↗pdf ↗

Study reveals hidden null components in overparametrized neural networks.

problem Hidden null components in overparametrized neural networks.
method Structure theorem of null space for neural networks using ridgelet transforms.
result Null components can be uniquely written as linear combinations of ridgelet transforms.

Integrates outlier detection into neural networks for improved performance.

problem Lack of competency awareness in machine learning systems, especially in detecting outliers.
method Null Space Analysis (NuSA) of neural networks, computing and controlling null space projection.
result NuSA-trained networks maintain classification performance and detect outliers effectively.

The paper addresses fairness in machine learning models through structural econometrics, projecting indexes into null spaces to find fair solutions.

problem Fairness concerns in machine learning, especially regarding disadvantaged groups.
method Model fairness as a linear operator, projecting indexes into null spaces to find fair solutions, balancing status quo and full fairness.
result Achieving approximate fairness by introducing a fairness penalty and balancing influences.

In the Compressed Sensing community, it is well known that given a matrix XRn×pX \in \mathbb R^{n\times p} with 2\ell_2 normalized columns, the Restricted Isometry Property (RIP) implies the Null Space Property (NSP). It is also well known that a small Coherence μμ implies a weak RIP, i.e. the singular values of XTX_T l…

2016-06-29abs ↗pdf ↗

We propose a meta-learning algorithm utilizing a linear transformer that carries out null-space projection of neural network outputs. The main idea is to construct an alternative classification space such that the error signals during few-shot learning are quickly zero-forced on that space so that reliable classificati…

2018-06-04abs ↗pdf ↗

Machine learning identifies chimera states in complex dynamical systems.

problem Chimera states are hard to identify due to their varied appearance and peculiar nature.
method Machine learning techniques, specifically random forest and oblique random forest with null space regularization.
result High accuracy in identifying chimera states across different dynamical models.

Physics-informed neural networks improve by measuring effective dimensionality of constraints.

problem Task interference in physics-informed neural networks due to shared parameter space.
method Introduce effective dimensionality (deffd_{eff}) as an operator invariant to quantify constraints.
result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.

Study on Gaussian-width complexity on statistical manifolds and its applications in learning and recovery.

problem Understanding the geometry of statistical manifolds and its implications for learning and recovery.
method Analysis of Fisher width and inverse-Fisher width, proving their complementary roles and establishing a relation between them.
result Established a sharp relation between Fisher width and inverse-Fisher width, showing they cannot reduce relative to Euclidean scale.

Paper defines Fisher co-metric on cotangent bundle and clarifies its relation to variance.

problem Defines Fisher co-metric on cotangent bundle and clarifies its relation to variance.
method Defines Fisher co-metric directly from Fisher metric without going through tangent bundle, using a natural correspondence between cotangent vectors and random variables.
result Clarifies the relation between Fisher co-metric and variance/covariance, trivializing the Cramér-Rao inequality.

Market strategies minimize Fisher information to minimize risk.

problem Applying minimum Fisher information principle to market dynamics.
method Analytical extension to quantum harmonic oscillator eigenstates and Gibbs distribution.
result Minimizing Fisher information reduces information and risk.

Generative Adversarial Networks (GANs) are powerful models for learning complex distributions. Stable training of GANs has been addressed in many recent works which explore different metrics between distributions. In this paper we introduce Fisher GAN which fits within the Integral Probability Metrics (IPM) framework f…

2017-05-26abs ↗pdf ↗

The study examines Fisher-Riemann geodesics for nonparametric probability densities.

problem Understanding nonparametric probability densities using Fisher-Riemann geometry.
method Obtaining Fisher-Riemann geodesics as a limit of parametric cases with increasing parameters.
result The weak limit approach for nonparametric probability densities.

Blog post discusses various implementations of Fisher Information for EWC in continual learning.

problem Improving Elastic Weight Consolidation (EWC) results by optimizing Fisher Information computation.
method Empirically compares different implementations of Fisher Information for EWC.
result Many reported EWC results can be improved by changing Fisher Information computation methods.

For even dimensional conformal manifolds several new conformally invariant objects were found recently: invariant differential complexes related to, but distinct from, the de Rham complex (these are elliptic in the case of Riemannian signature); the cohomology spaces of these; conformally stable form spaces that we may…

2007-08-28abs ↗pdf ↗

Survey on closed-form Fisher-Rao distance expressions.

problem Finding closed-form expressions for Fisher-Rao distance.
method Collect and present examples of closed-form expressions for Fisher-Rao distance of discrete and continuous distributions.
result Presentation of closed-form expressions for Fisher-Rao distance of various distributions.

Study improves distributed linear estimation under adversarial conditions.

problem Mean estimation of a random vector with adversarial measurements and asynchrony.
method Two-timescale ℓ1-minimization algorithm with tight convergence rates.
result Unified finite-time characterization of robustness, identifiability, and statistical efficiency.

In this paper, we propose new efficient algorithms to verify the null space condition in compressed sensing (CS). Given an (nm)×n(n-m) \times n (m>0m>0) CS matrix AA and a positive kk, we are interested in computing αk=max{z:Az=0,z0}max{K:Kk}\displaystyle α_k = \max_{\{z: Az=0,z\neq 0\}}\max_{\{K: |K|\leq k\}} zK1z1{\|z_K \|_{1}}{\|z\|_{1}}, where …

2013-06-11abs ↗pdf ↗

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.

We consider three different approaches to define natural Riemannian metrics on polytopes of stochastic matrices. First, we define a natural class of stochastic maps between these polytopes and give a metric characterization of Chentsov type in terms of invariance with respect to these maps. Second, we consider the Fish…

2014-04-01abs ↗pdf ↗

Fisher score is one of the most widely used supervised feature selection methods. However, it selects each feature independently according to their scores under the Fisher criterion, which leads to a suboptimal subset of features. In this paper, we present a generalized Fisher score to jointly select features. It aims …

2012-02-14abs ↗pdf ↗

We introduce Fisher consistency in the sense of unbiasedness as a desirable property for estimators of class prior probabilities. Lack of Fisher consistency could be used as a criterion to dismiss estimators that are unlikely to deliver precise estimates in test datasets under prior probability and more general dataset…

2017-01-19abs ↗pdf ↗

In information theory, Fisher information and Shannon information (entropy) are respectively used to quantify the uncertainty associated with the distribution modeling and the uncertainty in specifying the outcome of given variables. These two quantities are complementary and are jointly applied to information behavior…

2018-07-10abs ↗pdf ↗

Paper formulates particle flow using variational inference and Fisher-Rao gradient flow.

problem Estimating posterior densities in probabilistic models.
method Variational formulation of particle flow, Fisher-Rao gradient flow, Gaussian and Gaussian mixture approximations.
result Gaussian and Gaussian mixture approximations of Fisher-Rao particle flow reduce to Exact Daum and Huang particle flow under linear Gaussian assumptions.

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.