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.
Infinite mixture prototypes adapt to complex data for few-shot learning.
Sparse prototypes improve clustering of high-dimensional directional data.
Prototypal analysis is introduced to overcome two shortcomings of archetypal analysis: its sensitivity to outliers and its non-locality, which reduces its applicability as a learning tool. Same as archetypal analysis, prototypal analysis finds prototypes through convex combination of the data points and approximates th…
Although Recurrent Neural Network (RNN) has been a powerful tool for modeling sequential data, its performance is inadequate when processing sequences with multiple patterns. In this paper, we address this challenge by introducing a novel mixture layer and constructing an adaptive RNN. The mixture layer augmented RNN (…
Paper proposes interpretable RL policies from a mixture of experts.
Prototype model improves model auditing and understanding.
In this paper we propose a simple yet powerful method for learning representations in supervised learning scenarios where each original input datapoint is described by a set of vectors and their associated outputs may be given by soft labels indicating, for example, class probabilities. We represent an input datapoint …
This work investigates training infinite mixtures with maximum likelihood for improved uncertainty quantification.
Prototype-based memory network learns visual categories from unlabeled data.
Paper proposes a statistical approach for predicting lane changes in highway scenarios.
This paper studies convergence behavior of latent mixing measures that arise in finite and infinite mixture models, using transportation distances (i.e., Wasserstein metrics). The relationship between Wasserstein distances on the space of mixing measures and f-divergence functionals such as Hellinger and Kullback-Leibl…
This paper presents a new model called infinite mixtures of multivariate Gaussian processes, which can be used to learn vector-valued functions and applied to multitask learning. As an extension of the single multivariate Gaussian process, the mixture model has the advantages of modeling multimodal data and alleviating…
Nonparametric Bayesian approaches to clustering, information retrieval, language modeling and object recognition have recently shown great promise as a new paradigm for unsupervised data analysis. Most contributions have focused on the Dirichlet process mixture models or extensions thereof for which efficient Gibbs sam…
Analysis of SGD for Gaussian mixture classification using dynamical mean-field theory.
We construct an infinite-dimensional information manifold based on exponential Orlicz spaces without using the notion of exponential convergence. We then show that convex mixtures of probability densities lie on the same connected component of this manifold, and characterize the class of densities for which this mixtur…
Unified framework recovers exact input from SOM activation patterns.
Concentration of infinitely exchangeable sequences with bounded-difference constants
The paper proposes a Gaussian mixture model for Hilbert-space-valued data.
A new framework uses an Incremental Transformer to design geopolymer mixtures efficiently.
ProtoryNet interprets text sequences using prototype trajectories for better understanding.
Variational Proximal Policy Optimization improves reinforcement learning from human feedback.
Prototype networks on hyperspheres improve classification and regression.
Sum-of-norms clustering recovers mixtures of Gaussians even with infinite samples.
Optimal prototypes found for challenging pathological geometries.
Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is diffuse and it is hard to interpret the sampled partitionings. In this paper, we…
This paper presents an infinite variational autoencoder (VAE) whose capacity adapts to suit the input data. This is achieved using a mixture model where the mixing coefficients are modeled by a Dirichlet process, allowing us to integrate over the coefficients when performing inference. Critically, this then allows us t…
Method generates prototypes from small datasets for efficient learning.
Paper optimizes hyperspherical prototypes for better class separation.
In this work, we develop a novel Bayesian estimation method for the Dirichlet process (DP) mixture of the inverted Dirichlet distributions, which has been shown to be very flexible for modeling vectors with positive elements. The recently proposed extended variational inference (EVI) framework is adopted to derive an a…
Ensembles of decision trees perform well on many problems, but are not interpretable. In contrast to existing approaches in interpretability that focus on explaining relationships between features and predictions, we propose an alternative approach to interpret tree ensemble classifiers by surfacing representative poin…
Survey on Bayesian inference for Gaussian mixture models.
When estimating finite mixture models, it is common to make assumptions on the mixture components, such as parametric assumptions. In this work, we make no distributional assumptions on the mixture components and instead assume that observations from the mixture model are grouped, such that observations in the same gro…
A mixture of Gaussians fit to a single curved or heavy-tailed cluster will report that the data contains many clusters. To produce more appropriate clusterings, we introduce a model which warps a latent mixture of Gaussians to produce nonparametric cluster shapes. The possibly low-dimensional latent mixture model allow…
A mixture of Gaussians fit to a single curved or heavy-tailed cluster will report that the data contains many clusters. To produce more appropriate clusterings, we introduce a model which warps a latent mixture of Gaussians to produce nonparametric cluster shapes. The possibly low-dimensional latent mixture model allow…
We present the construction of an infinite dimensional Banach manifold of quantum mechanical states on a Hilbert space H using different types of small perturbations of a given Hamiltonian. We provide the manifold with a flat connection, called the exponential connection, and comment on the possibility of introducing t…
The paper uses learned prototypes to explain deep learning models for time-series data.
TPM improves medical image segmentation by separating foreground and background.
Meta-learning neural networks for better clustering representations.
A new neural network method improves interpretability and detection of outliers.
We present the Bayesian Case Model (BCM), a general framework for Bayesian case-based reasoning (CBR) and prototype classification and clustering. BCM brings the intuitive power of CBR to a Bayesian generative framework. The BCM learns prototypes, the "quintessential" observations that best represent clusters in a data…
A new method uses Mean Field Games to optimize mixture models of Bernoulli and categorical distributions.
Study of deep neural networks with dependent weights leading to new model limits and properties.
Pantypes improve prototypical models by capturing diverse input distributions.
Proposes scale mixture of NNGPs for more flexible stochastic processes.
We present the multidimensional membership mixture (M3) models where every dimension of the membership represents an independent mixture model and each data point is generated from the selected mixture components jointly. This is helpful when the data has a certain shared structure. For example, three unique means and …
Dirichlet Process(DP) is a Bayesian non-parametric prior for infinite mixture modeling, where the number of mixture components grows with the number of data items. The Hierarchical Dirichlet Process (HDP), is an extension of DP for grouped data, often used for non-parametric topic modeling, where each group is a mixtur…
IMKPL learns interpretable prototypes for better classification.
PTBCC improves accuracy in multi-class annotation aggregation by learning from prototype confusion matrices.