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.
Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.
We present an accelerated algorithm for hierarchical density based clustering. Our new algorithm improves upon HDBSCAN*, which itself provided a significant qualitative improvement over the popular DBSCAN algorithm. The accelerated HDBSCAN* algorithm provides comparable performance to DBSCAN, while supporting variable …
Coagent policy gradient algorithms (CPGAs) are reinforcement learning algorithms for training a class of stochastic neural networks called coagent networks. In this work, we prove that CPGAs converge to locally optimal policies. Additionally, we extend prior theory to encompass asynchronous and recurrent coagent networ…
Algorithm identifies best item from subsets with random utility model feedback.
Improved HMoE models using Laplace gating function enhance expert specialization and performance.
Loss assigns examples to classes and superclasses in hierarchical data.
Graph Neural Networks (GNNs) are based on repeated aggregations of information across nodes' neighbors in a graph. However, because common neighbors are shared between different nodes, this leads to repeated and inefficient computations. We propose Hierarchically Aggregated computation Graphs (HAGs), a new GNN graph re…
Kernel semi-implicit variational inference improves variational inference without additional optimization.
Gated attention improves performance by using a hierarchical mixture of experts.
In financial field, a robust software system is of vital importance to ensure the smooth operation of financial transactions. However, many financial corporations still depend on operators to identify and eliminate the system failures when financial software systems break down. This traditional operation method is time…
Object recognition systems usually require fully complete manually labeled training data to train the classifier. In this paper, we study the problem of object recognition where the training samples are missing during the classifier learning stage, a task also known as zero-shot learning. We propose a novel zero-shot l…
In many problem settings, parameter vectors are not merely sparse but dependent in such a way that non-zero coefficients tend to cluster together. We refer to this form of dependency as "region sparsity." Classical sparse regression methods, such as the lasso and automatic relevance determination (ARD), which model par…
Structural damage due to excessive loading or environmental degradation typically occurs in localized areas in the absence of collapse. This prior information about the spatial sparseness of structural damage is exploited here by a hierarchical sparse Bayesian learning framework with the goal of reducing the source of …
Proposes a flexible tournament design combining knockout and round-robin.
Kernel SIVI improves variational inference by avoiding lower-level optimization.
Improved elimination strategies for adaptive bandit identification reduce sample complexity and computational burden.
Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be useful if instead of a classification elimination of improbable classes is done…
Bayesian sparsification reduces deep neural network complexity.
A nonparametric method for time series analysis extracts envelopes, detects peaks, and clusters data.
Transformers mimic Bayesian reasoning in controlled settings, revealing geometric mechanisms.
New algorithm eliminates arms to minimize regret in complex bandit problems.
Learning how to act when there are many available actions in each state is a challenging task for Reinforcement Learning (RL) agents, especially when many of the actions are redundant or irrelevant. In such cases, it is sometimes easier to learn which actions not to take. In this work, we propose the Action-Elimination…
We introduce Neural Choice by Elimination, a new framework that integrates deep neural networks into probabilistic sequential choice models for learning to rank. Given a set of items to chose from, the elimination strategy starts with the whole item set and iteratively eliminates the least worthy item in the remaining …
Aims to eliminate domain bias in authentication without domain labels.
New method estimates treatment effects across different populations.
We simplify Khovanov homology for torus braids using Gaussian elimination.
A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when compared to plate diagrams for directed graphical models. To exploit efficient t…
Logic approach finds real singularities in differential equations.
We develop an approach for feature elimination in statistical learning with kernel machines, based on recursive elimination of features.We present theoretical properties of this method and show that it is uniformly consistent in finding the correct feature space under certain generalized assumptions.We present four cas…
In this paper, we theoretically prove that adding one special neuron per output unit eliminates all suboptimal local minima of any deep neural network, for multi-class classification, binary classification, and regression with an arbitrary loss function, under practical assumptions. At every local minimum of any deep n…
Bayesian neural networks (BNNs) hold great promise as a flexible and principled solution to deal with uncertainty when learning from finite data. Among approaches to realize probabilistic inference in deep neural networks, variational Bayes (VB) is theoretically grounded, generally applicable, and computationally effic…
Two new feature selection algorithms improve on RFE.
In this paper, we consider the problem of online learning of Markov decision processes (MDPs) with very large state spaces. Under the assumptions of realizable function approximation and low Bellman ranks, we develop an online learning algorithm that learns the optimal value function while at the same time achieving ve…
Paper introduces hierarchical softmax for global hierarchical classification tasks.
PoWER-BERT speeds up BERT inference by eliminating redundant word-vectors.
GPE algorithm optimizes nonparametric contextual bandits with efficient regret bounds.
This study compares hierarchical and non-hierarchical models for open-domain multi-turn dialog generation.
We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we descr…
Monte Carlo methods represent the "de facto" standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use simpler proposal probability densities to draw candidate samples. The performan…
TTERGM models improve social network predictions by incorporating triadic relationships.
Paper proposes a Renyi entropy-based method for tuning hierarchical topic models.
Neural NMF discovers hierarchical topics in multilayer data.
The paper develops a decision support system for hierarchical text classification of conference proceedings.
Bayesian Hierarchical Invariant Prediction refines ICP for better scalability and prior integration.
Hierarchical causal models help understand cause and effect in nested data.
We propose a computationally efficient wrapper feature selection method - called Autoencoder and Model Based Elimination of features using Relevance and Redundancy scores (AMBER) - that uses a single ranker model along with autoencoders to perform greedy backward elimination of features. The ranker model is used to pri…
The inequality of wealth distribution is a universal phenomenon in the civilized nations, and it is often imputed to the Matthew effect, that is, the rich get richer and the poor get poorer. Some philosophers unjustified this phenomenon and tried to put the human civilization upon the evenness of wealth. Noticing the f…
Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks intractable. In this paper we review techniques exploiting the graph structure for exact inference, b…