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

51101152202 · Jun 202619922001200920172026
48 results for hidden curvature

Graph Ricci flow reveals hidden hierarchies in stock market correlations.

problem Detecting hidden structures in the complex stock market graph.
method Using graph Ricci curvature and flow techniques to analyze the NASDAQ 100 index.
result Algorithm detects hidden hierarchies, community behavior, and clustering in financial markets.

Study generalizes Yang-Mills equations for special complex surfaces.

problem Deriving equations for self-dual Yang-Mills fields on complex surfaces.
method Generalization of flat space Yang's and Newman's equations to conformally Kahler Riemannian 4-manifolds.
result Continuous group of hidden symmetries found only for conformally half-flat geometry.

The classical Minkowski formula is extended to spacelike codimension-two submanifolds in spacetimes which admit "hidden symmetry" from conformal Killing-Yano two-forms. As an application, we obtain an Alexandrov type theorem for spacelike codimension-two submanifolds in a static spherically symmetric spacetime: a codim…

2014-09-08abs ↗pdf ↗

This paper introduces a new approach to finding knots and links with hidden symmetries using "hidden extensions", a class of hidden symmetries defined here. We exhibit a family of tangle complements in the ball whose boundaries have symmetries with hidden extensions, then we further extend these to hidden symmetries of…

2015-01-04abs ↗pdf ↗

RBM models reveal how hidden unit tail behavior affects pattern reconstruction.

problem Understanding how the tail behavior of hidden units in RBMs influences pattern reconstruction.
method Identified an effective energy function for RBMs and studied its local minima.
result The ability to reconstruct patterns depends on the tail behavior of the hidden unit prior distribution.

This paper reviews recent advances in Bayesian nonparametric techniques for constructing and performing inference in infinite hidden Markov models. We focus on variants of Bayesian nonparametric hidden Markov models that enhance a posteriori state-persistence in particular. This paper also introduces a new Bayesian non…

2014-06-30abs ↗pdf ↗

Supervised learning frequently boils down to determining hidden and bright parameters in a parameterized hypothesis space based on finite input-output samples. The hidden parameters determine the attributions of hidden predictors or the nonlinear mechanism of an estimator, while the bright parameters characterize how h…

2018-03-22abs ↗pdf ↗

Randomly chosen primary hidden units and derived secondary units reduce neural network complexity.

problem Large number of hidden units in neural networks.
method Introducing primary and secondary hidden units with random weights for primary units and derived weights for secondary units.
result Significant reduction in the number of hidden units without compromising accuracy.

Hidden regular variation is a sub-model of multivariate regular variation and facilitates accurate estimation of joint tail probabilities. We generalize the model of hidden regular variation to what we call hidden domain of attraction. We exhibit examples that illustrate the need for a more general model and discuss de…

2011-10-04abs ↗pdf ↗

We present a non-parametric Bayesian approach to structure learning with hidden causes. Previous Bayesian treatments of this problem define a prior over the number of hidden causes and use algorithms such as reversible jump Markov chain Monte Carlo to move between solutions. In contrast, we assume that the number of hi…

2012-06-27abs ↗pdf ↗

Hidden Markov Neural Networks balance adaptation and forgetting in time-series data.

problem Balancing adaptation to new data and forgetting outdated information in time-series forecasting.
method Modeling weights as hidden states of a Hidden Markov model, using a filtering algorithm for learning a variational approximation of the posterior distribution over weights, and employing sequential Bayes by Backprop with variational DropConnect for regularization.
result Achieves strong predictive performance and effective uncertainty quantification on various tasks.

This paper is concerned with the sparsification of the input-hidden weights of ELM (Extreme Learning Machine). For ordinary feedforward neural networks, the sparsification is usually done by introducing certain regularization technique into the learning process of the network. But this strategy can not be applied for E…

2018-01-22abs ↗pdf ↗

A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Detecting hidden variables poses two problems: determining the relations to other variables in the model and determining the number of states of …

2013-01-10abs ↗pdf ↗

The paper proves limitations on hyperbolic knot complements with hidden symmetries.

problem Identifying hyperbolic knot complements with hidden symmetries.
method Obstructions to infinitely many fillings producing knot complements with hidden symmetries.
result The figure-eight knot complement is the only hyperbolic knot complement with hidden symmetries.

This paper tackles hidden state inference for HMMs using particle filtering.

problem Inference for hidden states under HMMs is challenging due to unavailable true labels.
method Adaptive conformal inference framework using particle filtering.
result The framework produces prediction sets with specific aggregated coverage levels.

The hidden M-algebra is integrated into a super-Lie group, allowing for compactification of extra dimensions.

problem Integrating the hidden M-algebra into a super-Lie group to model super-exceptional spacetimes.
method Left-invariant extension of the decomposed M-theory 3-form, providing a computer-checked re-derivation and streamlined conception of super-Lie groups.
result Lattice subgroups of the hidden M-group allow toroidal compactification of hidden dimensions, akin to topological T-duality.

Multilabel classification is an important problem in a wide range of domains such as text categorization and music annotation. In this paper, we present a probabilistic model, Multilabel Logistic Regression with Hidden variables (MLRH), which extends the standard logistic regression by introducing hidden variables. Hid…

2019-12-03abs ↗pdf ↗

Generalizes moment-matching for exponential families with conditioning or hidden data.

problem Generalizing moment-matching conditions for exponential families with conditioning or hidden data.
method First-principles explanation and self-contained derivation of generalized moment-matching conditions.
result Derives generalized moment-matching conditions for conditional exponential families and hidden data.

Hidden regular variation defines a subfamily of distributions satisfying multivariate regular variation on E=[0,]d\{(0,0,...,0)}\mathbb{E} = [0, \infty]^d \backslash \{(0,0, ..., 0) \} and models another regular variation on the sub-cone E(2)=E\i=1dLi\mathbb{E}^{(2)} = \mathbb{E} \backslash \cup_{i=1}^d \mathbb{L}_i, where Li\mathbb{L}_i is the $i…

2010-01-27abs ↗pdf ↗

Study examines dependence properties of Bayesian neural network units in finite-width networks.

problem Understanding dependence properties of hidden units in practical finite-width Bayesian neural networks.
method Theoretical analysis and empirical evaluation of depth and width impacts.
result Hidden units in finite-width Bayesian neural networks are dependent, contrary to the infinite-width limit assumption.

Modified asymmetric hidden Markov models for time series with autoregressive components.

problem Dynamic relationships between variables in time series data.
method Introducing an asymmetric autoregressive component to recent asymmetric hidden Markov models.
result The model can choose the optimal autoregressive order for better likelihood.

In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional 1+Kγ2ds\int \sqrt{1+K_γ^2} ds, depending both on length and curvature KK. We fix starting and ending points as well as initial and final directions. For this functional we discuss the problem o…

2009-06-29abs ↗pdf ↗

Study on hidden units in finite Bayesian neural networks and their tail properties.

problem Understanding the behavior of hidden units in finite Bayesian neural networks.
method Introduced a generalized Weibull-tail property to describe hidden units tails.
result Unit priors become heavier-tailed going deeper, providing insights into finite Bayesian neural networks.

Universal MLPs with a single hidden layer can learn any function.

problem Learning on various data structures like sequences, images, sets, and graphs.
method Using group theory, the paper proves the universality of a broad class of equivariant MLPs with a single hidden layer.
result Having a hidden layer on which the group acts regularly is sufficient for universal equivariance (invariance).

New method accounts for hidden context in preference learning for RLHF models.

problem Incomplete data with hidden context affects RLHF model outcomes.
method Distributional Preference Learning (DPL) methods estimate hidden context distributions.
result DPL methods reduce RLHF vulnerabilities by accounting for hidden context.

Detect hidden confounding in observational data using multiple environments.

problem Detect hidden confounding in observational data.
method Theoretical framework and simulation studies to test for hidden confounding.
result The proposed procedure correctly predicts hidden confounding, especially when bias is large.

A neural network with a single hidden layer can't represent certain multivariable functions.

problem Representing certain multivariable functions with a neural network having only one hidden layer.
method Developed a continuum version of a one-hidden-layer neural network with ReLU activation, and proved constraints on its parameters and second derivative.
result Existence of a smooth binary function that cannot be precisely represented by any such neural network.

We define a Hidden Markov Model (HMM) in which each hidden state has time-dependent activity levels\textit{activity levels} that drive transitions and emissions, and show how to estimate its parameters. Our construction is motivated by the problem of inferring human mobility on sub-daily time scales from, for example, mobile phone …

2015-07-27abs ↗pdf ↗

A "hidden symmetry" of a Riemannian manifold M is an isometry of a d-sheeted, 1<d<\infty, Riemannian cover of M which is not the lift of any isometry. In this paper we characterize the locally symmetric metric(s) on a closed, arithmetic manifold as the unique metric with infinitely many hidden symmetries.

2004-05-10abs ↗pdf ↗