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.
Bayesian stacking improves model performance with varying model weights.
BayesBlend blends multiple models' predictions for better insurance loss predictions.
Nowadays, hyperspectral image classification widely copes with spatial information to improve accuracy. One of the most popular way to integrate such information is to extract hierarchical features from a multiscale segmentation. In the classification context, the extracted features are commonly concatenated into a lon…
In this paper, we propose a novel generative model named Stacked Generative Adversarial Networks (SGAN), which is trained to invert the hierarchical representations of a bottom-up discriminative network. Our model consists of a top-down stack of GANs, each learned to generate lower-level representations conditioned on …
Improved outlier detection in hierarchical Gaussian Processes using Wasserstein-2 kernels.
Stacking improves inference for multimodal Bayesian posterior distributions.
There has been a rapid proliferation of machine learning/deep learning (ML) models and wide adoption of them in many application domains. This has made profiling and characterization of ML model performance an increasingly pressing task for both hardware designers and system providers, as they would like to offer the b…
A deep learning approach classifies medical images hierarchically.
The Dirichlet process and its extension, the Pitman-Yor process, are stochastic processes that take probability distributions as a parameter. These processes can be stacked up to form a hierarchical nonparametric Bayesian model. In this article, we present efficient methods for the use of these processes in this hierar…
HGNet improves GNNs' ability to handle long-range interactions in graphs.
New methods improve electricity load forecasting using hierarchical transfer learning.
In this paper, we present Gamma-LSTM, an enhanced long short term memory (LSTM) unit, to enable learning of hierarchical representations through multiple stages of temporal abstractions. Gamma memory, a hierarchical memory unit, forms the central memory of Gamma-LSTM with gates to regulate the information flow into var…
t-SNE and hierarchical clustering are popular methods of exploratory data analysis, particularly in biology. Building on recent advances in speeding up t-SNE and obtaining finer-grained structure, we combine the two to create tree-SNE, a hierarchical clustering and visualization algorithm based on stacked one-dimension…
Kernel methods are powerful tools to capture nonlinear patterns behind data. They implicitly learn high (even infinite) dimensional nonlinear features in the Reproducing Kernel Hilbert Space (RKHS) while making the computation tractable by leveraging the kernel trick. Classic kernel methods learn a single layer of nonl…
In this article we consider the Conditional Super Learner (CSL), an algorithm which selects the best model candidate from a library conditional on the covariates. The CSL expands the idea of using cross-validation to select the best model and merges it with meta learning. Here we propose a specific algorithm that finds…
StaPLR improves Alzheimer's disease classification by identifying important MRI scan types and measures.
The successful application of general reinforcement learning algorithms to real-world robotics applications is often limited by their high data requirements. We introduce Regularized Hierarchical Policy Optimization (RHPO) to improve data-efficiency for domains with multiple dominant tasks and ultimately reduce require…
We present a signal representation framework called the sparse manifold transform that combines key ideas from sparse coding, manifold learning, and slow feature analysis. It turns non-linear transformations in the primary sensory signal space into linear interpolations in a representational embedding space while maint…
Continuous semi-implicit models enable faster training and better performance in generative modeling.
Stacking is a general approach for combining multiple models toward greater predictive accuracy. It has found various application across different domains, ensuing from its meta-learning nature. Our understanding, nevertheless, on how and why stacking works remains intuitive and lacking in theoretical insight. In this …
We review the basic definition of a stack and apply it to the topological and smooth settings. We then address two subtleties of the theory: the correct definition of a ``stack over a stack'' and the distinction between small stacks (which are algebraic objects) and large stacks (which are generalized spaces).
In this article, we derive many properties of étale stacks in various contexts, and prove that étale stacks may be characterized categorically as those stacks that arise as prolongations of stacks on a site of spaces and local homeomorphisms. Moreover, we show that the bicategory of étale differentiable stacks and loca…
We introduce an automatic machine learning (AutoML) modeling architecture called Autostacker, which combines an innovative hierarchical stacking architecture and an Evolutionary Algorithm (EA) to perform efficient parameter search. Neither prior domain knowledge about the data nor feature preprocessing is needed. Using…
Constructs cohomology decompositions for symmetric stacks.
New neural stack and Turing Machine architectures prove stability and computational power.
This work proposes a new method to train models with deep latent hierarchies using Optimal Transport.
Paper combines machine learning and model averaging for robust parameter estimation.
We generalize the notion of a small sheaf of sets over a topological space or manifold to define the notion of a small stack of groupoids over an étale topological or differentiable stack. We then provide a construction analogous to the étalé space construction in this context, establishing an equivalence of 2-categori…
New method automates asymmetric choice for better skill transfer in reinforcement learning.
This work characterizes global quotient stacks---smooth stacks associated to a finite group acting a manifold---among smooth quotient stacks , where is a smooth manifold equipped with a smooth proper action by a Lie group . The characterization is described in terms of the action of the connected componen…
The BPS decomposition theorem splits cohomology of symmetric stacks into invariant parts.
Multi-layered representation is believed to be the key ingredient of deep neural networks especially in cognitive tasks like computer vision. While non-differentiable models such as gradient boosting decision trees (GBDTs) are the dominant methods for modeling discrete or tabular data, they are hard to incorporate with…
Stacked conformal prediction simplifies model validation.
Constructs moduli stacks for quiver connections and extends non-Abelian Hodge theory.
Study connections on Lie groupoids and stacks using Atiyah sequences.
In this paper, we consider diffeological spaces as stacks over the site of smooth manifolds, as well as the "underlying" diffeological space of any stack. More precisely, we consider diffeological spaces as so-called concrete sheaves and show that the Grothendieck construction sending these sheaves to stacks has a left…
Constructs moduli stacks of quiver bundles and applies to Higgs bundles.
New potentials found for sheaves on Calabi-Yau 4-folds.
We study compositional generalization, viz., the problem of zero-shot generalization to novel compositions of concepts in a domain. Standard neural networks fail to a large extent on compositional learning. We propose Tree Stack Memory Units (Tree-SMU) to enable strong compositional generalization. Tree-SMU is a recurs…
Latent MoS learns multiple symmetries for efficient dynamic learning.
This thesis is divided into four chapters. The first chapter discusses the relationship between stacks on a site and groupoids internal to the site. It includes a rigorous proof of the folklore result that there is an equivalence between the bicategory of internal groupoids and the bicategory of geometric stacks. The s…
Stacked LSTM networks improve traffic volume forecasting.
Studies geometric structures on Lie groupoids and differentiable stacks.
Stacking improves deep neural network training efficiency.
A theory of dg schemes is developed so that it becomes a homotopy site, and the corresponding infinity category of stacks is equivalent to the infinity category of stacks, as constructed by Toen and Vezzosi, on the site of dg algebras whose cohomologies have finitely many generators in each degree. Stacks represented b…
Study moduli spaces of elliptic PDEs using derived -geometry.
Stacking methods improve the prediction performance of regression models. A simple way to stack base regressions estimators is by combining them linearly, as done by \citet{breiman1996stacked}. Even though this approach is useful from an interpretative perspective, it often does not lead to high predictive power. We pr…
We develop a universal framework to study smooth higher orbifolds on the one hand and higher Deligne-Mumford stacks (as well as their derived and spectral variants) on the other, and use this framework to obtain a completely categorical description of which stacks arise as the functor of points of such objects. We choo…