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

3807601,1391,519 · Jun 202019922001200920172026
48 results for Random Hierarchy Models

Study identifies pitfalls in assessing hierarchies for multi-class classification.

problem Lack of understanding in selecting hierarchies for multi-class classification.
method Analyzed and compared popular approaches to extracting hierarchies.
result Hierarchy quality becomes irrelevant when using powerful classifiers.

New tools in nonlinear random matrices improve understanding of the Sum of Squares hierarchy.

problem Improving the Sum of Squares (SoS) hierarchy's performance on average-case problems.
method Developed new tools in nonlinear random matrices and applied them to analyze the SoS hierarchy.
result Subexponential-time SoS lower bounds for various problems, offering evidence for the low-degree likelihood ratio hypothesis.

This work improves metric learning models by incorporating class hierarchies.

problem Class hierarchies are often ignored in classification-based metric learning models.
method Trained softmax classifier and metric learning models with predefined class hierarchies.
result ProxyDR model performs better in hierarchical inference and hierarchy-informed performance.

Proves deep networks can learn hierarchical structures efficiently.

problem Understanding how deep networks learn hierarchical structures in data.
method Random Hierarchy Models, gradient-based methods, layerwise training.
result Proves deep networks can efficiently learn hierarchical structures.

SRHM explains deep learning's hierarchy and insensitivity to transformations.

problem Understanding how deep networks learn hierarchical and invariant representations.
method Introducing sparsity to generative hierarchical models of data.
result Hierarchical representations and insensitivity to transformations correlate strongly with deep network performance.

Paper improves variational inference on Boolean hypercube using quantum methods.

problem Improving variational inference for pairwise Markov random fields on the Boolean hypercube.
method Quantum relaxations of the Kullback-Leibler divergence for upper-bounds, primal-dual optimization, and greedy selection of hierarchies.
result Efficient algorithm and improved bounds for variational inference.

The study analyzes games and social hierarchies, incorporating luck and depth of competition.

problem Analyzing patterns of wins and losses in games and social hierarchies.
method Generalized probabilistic models incorporating luck and depth of competition.
result Social competition tends to be deeper with many distinct levels, but there is often a chance of upset victories.

Deep networks learn hierarchical data by invariant representations.

problem How many examples are needed for deep networks to learn hierarchical data?
method Random Hierarchy Model: synthetic tasks inspired by language and images hierarchy.
result Deep networks learn by invariant representations and require a detectable number of correlations between low-level features and classes.

For the tensor PCA (principal component analysis) problem, we propose a new hierarchy of increasingly powerful algorithms with increasing runtime. Our hierarchy is analogous to the sum-of-squares (SOS) hierarchy but is instead inspired by statistical physics and related algorithms such as belief propagation and AMP (ap…

2019-04-08abs ↗pdf ↗

We propose a formally completely integrable extension of heat hierarchy based on the space of symmetries isomorphic to the Weyl algebra A1\mathcal{A}_1. The extended heat hierarchy will be the basic model for the analysis of the extension of KP hierarchy, and other integrable equations.

2014-01-19abs ↗pdf ↗

The study examines neural networks with random weights and biases, finding that depth-to-width ratio controls fluctuations and correlations.

problem Exploring the exploding and vanishing gradient problem in neural networks with random weights and biases.
method Sharp estimates of joint cumulants and solving cumulant recursions in powers of 1/n.
result The depth-to-width ratio L/nL/n plays a crucial role in controlling fluctuations and correlations, leading to the occurrence of exploding and vanishing gradients.

ProHOC detects OOD samples in class hierarchies, predicting them to correct internal nodes.

problem Binary OOD detection ignores semantic relationships between OOD and ID classes.
method Probabilistic hierarchical model using multi-depth networks trained for ID classification.
result ProHOC effectively classifies OOD samples to their correct internal nodes in class hierarchies.

Explicitly constructed 3XOR instances hard for Sum-of-Squares hierarchy.

problem Hard instances for Sum-of-Squares hierarchy.
method Based on high-dimensional expanders (LSV complexes), using cosystolic expansion and local isoperimetric inequality.
result Constructs explicit 3XOR instances hard for O(logn)O(\sqrt{\log n}) levels of Sum-of-Squares hierarchy.

We present the Lax pair formalism for certain extension of the continuous limit of the classical Toda lattice hierarchy, provide a well defined notion of tau function for its solutions, and give an explicit formulation of the relationship between the CP1CP^1 topological sigma model and the extended Toda hierarchy. We al…

2003-06-29abs ↗pdf ↗

We show that simple random walks on (non-trivial) relatively hyperbolic groups stay O(log(n))O(\log(n))-close to geodesics, where nn is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class groups stay O(nlog(n))O(\sqrt{n\log(n)})-close to geodesics and hierarchy paths. Along the…

2013-05-23abs ↗pdf ↗

We develop constructions for exchangeable sequences of point processes that are rendered conditionally-i.i.d. negative binomial processes by a (possibly unknown) random measure called the base measure. Negative binomial processes are useful in Bayesian nonparametrics as models for random multisets, and in applications …

2019-08-17abs ↗pdf ↗

Constructs integrable hierarchies for generalized Frobenius manifolds with non-flat unity.

problem Integrable hierarchies for generalized Frobenius manifolds with non-flat unity.
method Constructs a bihamiltonian integrable hierarchy of hydrodynamic type.
result Integrable hierarchy possesses Virasoro symmetries and a tau structure.

In the noisy tensor completion problem we observe mm entries (whose location is chosen uniformly at random) from an unknown n1×n2×n3n_1 \times n_2 \times n_3 tensor TT. We assume that TT is entry-wise close to being rank rr. Our goal is to fill in its missing entries using as few observations as possible. Let $n = \max(n…

2015-01-26abs ↗pdf ↗

This work proposes a new method to train models with deep latent hierarchies using Optimal Transport.

problem Training models with deep latent hierarchies using VAEs often leads to the 'latent variable collapse' issue.
method Proposes a novel approach based on Optimal Transport to train models with deep latent hierarchies.
result The method avoids the 'latent variable collapse' issue and provides better sample generations and latent representation.

We add a set of convex constraints to the lasso to produce sparse interaction models that honor the hierarchy restriction that an interaction only be included in a model if one or both variables are marginally important. We give a precise characterization of the effect of this hierarchy constraint, prove that hierarchy…

2012-05-22abs ↗pdf ↗

Legendre transformations link related integrable hierarchies.

problem Understanding relationships between integrable hierarchies.
method Legendre-type transformations of generalized Frobenius manifolds.
result Linear reciprocal transformations link related hierarchies.

Twisted UU- and twisted U/KU/K-hierarchies are soliton hierarchies introduced by Terng to find higher flows of the generalized sine-Gordon equation. Twisted O(J,J)O(J)×O(J)\frac {O(J,J)}{O(J)\times O(J)}-hierarchies are among the most important classes of twisted hierarchies. In this paper, interesting first and higher flows of twi…

2011-03-31abs ↗pdf ↗

Wise's Quasiconvex Hierarchy Theorem classifying hyperbolic virtually compact special groups in terms of quasiconvex hierarchies played an essential role in Agol's proof of the Virtual Haken Conjecture. Answering a question of Wise, we construct a new virtual quasiconvex hierarchy for relatively hyperbolic virtually co…

2019-03-28abs ↗pdf ↗

New hierarchies derived from KP hierarchy using non-formal operators and Yang-Mills action.

problem Formal solutions of KP hierarchy and their non-formal counterparts.
method Developed new hierarchies of non-linear equations on non-formal pseudo-differential operators.
result Expressed one hierarchy as Yang-Mills action minimization.

C-HMCNN(h) improves HMC classification by leveraging class hierarchy.

problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.

Symmetry reduction of Painlevé IV to Flaschka-Newell Painlevé II

problem Isomonodromic deformation problem associated with rank-two meromorphic connections
method Symmetry Ψ(λ)=σ1Ψ(λ)σ1Ψ(-λ)= σ_1 Ψ(λ) σ_1
result Induced isomonodromic dynamics coincides with Flaschka-Newell Painlevé II hierarchy

Scroll structures on solutions of 4D integrable equations are involutive and governed by a dispersionless hierarchy.

problem Characterizing the geometry of solutions to 4D integrable equations.
method Defining rational normal scrolls and showing their involutivity.
result Involutive scroll structures are governed by a dispersionless integrable hierarchy.

A relation between the Goldstein-Petrich hierarchy for plane curves and the Toda lattice hierarchy is investigated. A representation formula for plane curves is given in terms of a special class of ττ-functions of the Toda lattice hierarchy. A representation formula for discretized plane curves is also discussed.

2013-10-26abs ↗pdf ↗

Constructs tri-Hamiltonian structure and Frobenius manifold for asymmetric gAL hierarchy

problem Tri-Hamiltonian structure and Frobenius manifold for asymmetric gAL hierarchy
method Local tri-Hamiltonian structure construction and Frobenius manifold construction
result Dispersionless limits of flows belong to Principal Hierarchy

Unified framework for subgraph-enhanced GNNs, improving prediction accuracy and reducing computation time.

problem Limited understanding of subgraph-enhanced GNNs and their relation to the Weisfeiler-Leman hierarchy.
method Theoretical framework, theoretical expressivity results, and data-driven subgraph sampling methods.
result Data-driven subgraph-enhanced GNNs outperform non-data-driven methods in predictive performance.

New integrable deformations for topological hierarchies from Frobenius manifolds.

problem Integrable deformations of topological hierarchies from Frobenius manifolds.
method Construction of integrable deformations with polynomial tau-structures.
result Conjecture of universal object for Riemann--Hopf hierarchy.

We introduce two families of soliton hierarchies: the twisted hierarchies associated to symmetric spaces. The Lax pairs of these two hierarchies are Laurent polynomials in the spectral variable. Our constructions gives a hierarchy of commuting flows for the generalized sine-Gordon equation (GSGE), which is the Gauss-Co…

2010-10-27abs ↗pdf ↗

The thesis introduces methods to use semantic hierarchy in image classification.

problem Limited work in training image classifiers with non-conventional external guidance.
method Injects label hierarchy knowledge into arbitrary classifiers and uses order-preserving embeddings for image classification.
result Both embedding-based models and CNN-classifiers with hierarchical information outperform a hierarchy-agnostic model.

Paper investigates methods to improve classification by inducing a hierarchy from flat labels.

problem Improving classification performance on datasets lacking a natural hierarchy.
method The approach involves clustering conditional distributions and using a hierarchical classifier with the induced hierarchy.
result The methods can discover latent hierarchies and improve accuracy in various applications.

We prove that the extended Toda hierarchy of \cite{CDZ} admits nonabelian Lie algebra of infinitesimal symmetries isomorphic to the half of the Virasoro algebra. The generators LmL_m, m1m\geq -1 of the Lie algebra act by linear differential operators onto the tau function of the hierarchy. We also prove that the tau fu…

2003-08-15abs ↗pdf ↗