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

146291437582 · May 202619922001200920172026
48 results for Rule Hierarchy Framework

New methods prune unpromising rules from KGs, improving scalability and runtime.

problem Scalability issues in walk-based rule learning from KGs.
method Rule Hierarchy Framework (RHF) and Hierarchical Pruning (HPMs).
result Significant reductions in runtime and number of learned rules without compromising predictive performance.

A new hierarchy quantifies agency in systems based on information processing.

problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.

Mixed superposition rules, i.e., functions describing the general solution of a system of first-order differential equations in terms of a generic family of particular solutions of first-order systems and some constants, are studied. The main achievement is a generalization of the celebrated Lie-Scheffers Theorem, char…

2012-03-01abs ↗pdf ↗

Generates infinite-depth hierarchical clusters from few examples.

problem Inadequate finite-sample clustering methods for fine-scale hierarchical structures.
method Classification fields generated by a local refinement rule, approximated by predictors.
result Learned predictors can approximate infinite-depth hierarchical structures.

This work proposes optimal decision rules for hierarchical classifiers to better align with evaluation metrics.

problem Heuristic decision rules in hierarchical classification do not align with evaluation metrics.
method Derives optimal decision rules for various prediction settings, focusing on hierarchical hFβhF_β scores.
result Optimal decision rules enhance the performance and reliability of hierarchical classifiers.

Paper addresses limitations of traditional hierarchical clustering methods.

problem Traditional hierarchical clustering methods face limitations in binary trees and ultrametrics.
method Introduces the notion of a valid hierarchy and a two-step algorithm to construct a binary tree and prune it to enforce validity.
result Proposes a method to recover the finest valid hierarchy, which is not constrained to binary structures.

New method controls false discoveries in structured hypothesis spaces.

problem Controlling false discoveries in large-scale, interconnected hypothesis spaces.
method Reproducing Kernel Hilbert Space (RKHS) optimization for structured FDR control.
result Unified framework for continuous domains, graphs, and hierarchies.

Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of semi-algebraic proof systems that manipulate polynomial inequalities via elementary inferen…

2019-06-04abs ↗pdf ↗

We demonstrate that SDYM equations for the Lie algebra of one-dimensional vector fields represent a natural reduction in the framework of general linearly degenerate dispersionless hierarchy. We define the reduction in terms of wave functions, introduce generating relation, Lax-Sato equations and the dressing scheme fo…

2016-03-01abs ↗pdf ↗

Solves the challenge of retrieving item-specific financial information from Form 10-Q filings.

problem Retrieving item-specific information from Form 10-Q filings with varying formats and machine-readable hierarchy.
method Complements a rule-based algorithm with a Convolutional Neural Network (CNN) image classifier to itemize 10-Q files.
result Demonstrates a generalized pipeline for rapid data retrieval from a large volume of textual data.

Unified theory for neural scaling laws in hierarchically compositional data.

problem Understanding neural scaling laws in hierarchically compositional data.
method Probabilistic context-free grammars and power-law distributed production rules.
result Unified learning curve behavior for classification and next-token prediction tasks.

Develops a multilevel Monte Carlo framework with dropout for efficient uncertainty quantification.

problem Efficiently quantify uncertainty in complex models using dropout.
method Integrates multilevel Monte Carlo with Monte Carlo dropout, creating coupled estimators to reduce variance.
result Demonstrates significant variance reduction and efficiency gains over single-level Monte Carlo dropout.

When related learning tasks are naturally arranged in a hierarchy, an appealing approach for coping with scarcity of instances is that of transfer learning using a hierarchical Bayes framework. As fully Bayesian computations can be difficult and computationally demanding, it is often desirable to use posterior point es…

2012-06-13abs ↗pdf ↗

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.

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.

The problem of community detection in networks is usually formulated as finding a single partition of the network into some "correct" number of communities. We argue that it is more interpretable and in some regimes more accurate to construct a hierarchical tree of communities instead. This can be done with a simple to…

2018-10-02abs ↗pdf ↗

NeurT-FDR controls FDR by incorporating feature hierarchy.

problem Controlling FDR in complex, large-scale hypothesis testing problems.
method NeurT-FDR uses a neural network to parametrize test-level covariates and a regression framework to adjust feature hierarchy.
result NeurT-FDR makes substantially more discoveries than competitive baselines.

This is the third in a series of papers attempting to describe a uniform geometric framework in which many integrable systems can be placed. A soliton hierarchy can be constructed from a splitting of an infinite dimensional group LL as positive and negative subgroups L_+, L_- and a commuting sequence in the Lie algebr…

2014-06-19abs ↗pdf ↗

The seemingly infinite diversity of the natural world arises from a relatively small set of coherent rules, such as the laws of physics or chemistry. We conjecture that these rules give rise to regularities that can be discovered through primarily unsupervised experiences and represented as abstract concepts. If such r…

2017-07-11abs ↗pdf ↗

We study an economic model where agents trade a variety of products by using one of three competing rules: "need", "greed" and "noise". We find that the optimal strategy for any agent depends on both product composition in the overall market and composition of strategies in the market. In particular, a strategy that do…

2004-08-25abs ↗pdf ↗

In this short note we show how Dubrovin's integrable hierarchies, defined using the Gromov-Witten theory of a closed symplectic manifold, generalizes to Hamiltonian Floer theory. In particular, we show how the required generalization of the PSS isomorphism, relating Gromov-Witten theory and Hamiltonian Floer theory, ca…

2012-06-07abs ↗pdf ↗

We prove that the Kupershmidt deformation of a bi-Hamiltonian system is itself bi-Hamiltonian. Moreover, Magri hierarchies of the initial system give rise to Magri hierarchies of Kupershmidt deformations as well. Since Kupershmidt deformations are not written in evolution form, we start with an outline a geometric fram…

2008-12-29abs ↗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.

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.

Solving different types of optimization models (including parameters fitting) for support vector machines on large-scale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training s…

2014-10-13abs ↗pdf ↗

New method improves blackbox attack transferability by perturbing feature hierarchy.

problem Improving transferability of blackbox attacks across different models and datasets.
method Perturbs representations throughout feature hierarchy to mimic other classes.
result Achieves 10x increase in targeted success rate compared to other methods.

Building systems that autonomously create temporal abstractions from data is a key challenge in scaling learning and planning in reinforcement learning. One popular approach for addressing this challenge is the options framework (Sutton et al., 1999). However, only recently in (Bacon et al., 2017) was a policy gradient…

2018-10-27abs ↗pdf ↗

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.

A network supporting deep unsupervised learning is presented. The network is an autoencoder with lateral shortcut connections from the encoder to decoder at each level of the hierarchy. The lateral shortcut connections allow the higher levels of the hierarchy to focus on abstract invariant features. While standard auto…

2014-11-28abs ↗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 ↗

Unified quadrature framework for large-scale kernel machines.

problem Efficiently approximating kernel functions for large-scale machine learning.
method Deterministic and randomized interpolatory rules for numerical integration of kernel functions.
result The proposed method reduces the number of nodes needed for accurate kernel approximation.

New framework learns interpretable rule ensembles without sacrificing accuracy.

problem Trade-off between accuracy and interpretability in rule ensembles.
method Introduces local interpretability and a regularizer to promote it, using coordinate descent with local search.
result Learns rule ensembles with fewer rules to explain individual predictions, maintaining comparable accuracy.

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 ↗

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 ↗

Loss assigns examples to classes and superclasses in hierarchical data.

problem Learning from hierarchical classification problems with known class hierarchy.
method Introduces a loss function that considers the hierarchy of classes, aiming for consistent classification across different granularities.
result Improves accuracy and reduces coarse errors in classification compared to cross-entropy loss.

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.