We propose a novel stacked generalization (stacking) method as a dynamic ensemble technique using a pool of heterogeneous classifiers for node label classification on networks. The proposed method assigns component models a set of functional coefficients, which can vary smoothly with certain topological features of a n…
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,695 papers · 148 categories
Trend · papers per month
48 results for “stacked classification”
pystacked combines machine learning models for improved predictions.
problem Improving machine learning model performance through stacking.
method Stacked generalization using Python's scikit-learn with various base learners.
result Enhanced predictive models through combining multiple machine learning algorithms.
Study evaluates different meta-learners for multi-view stacking.
problem Choosing the best meta-learner for multi-view stacking.
method Seven different meta-learners were evaluated in simulations and real data.
result Nonnegative lasso, nonnegative adaptive lasso, and nonnegative elastic net are suitable meta-learners.
Machine learning improves CHD screening accuracy from 70% to 87.7%.
problem Predicting coronary heart disease using echocardiography and clinical features.
method Ensemble machine learning approach with model stacking and two-step stacking.
result Improved CHD classification accuracy from 70% to 87.7%.
Stacks in Poisson Geometrymath.DG
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…
In this paper we relate the study of actions of discrete groups over connected manifolds to that of their orbit spaces seen as differentiable stacks. We show that the orbit stack of a discrete dynamical system on a simply connected manifold encodes the dynamics up to conjugation and inversion. We also prove a generaliz…
Classification outperforms regression in portfolio construction, yielding higher Sharpe ratios.
problem Determining which machine learning approach (classification vs. regression) is more effective for portfolio construction.
method Used stacking ensemble of gradient boosted tree, random forest, and neural network models.
result Classification yields higher Sharpe ratios and economically significant alphas compared to regression.
We implemented several multilabel classification algorithms in the machine learning package mlr. The implemented methods are binary relevance, classifier chains, nested stacking, dependent binary relevance and stacking, which can be used with any base learner that is accessible in mlr. Moreover, there is access to the …
pRSL combines probabilistic rules to improve multi-label classification.
problem Modeling the structure between multi-label classes for better performance.
method Uses probabilistic propositional logic rules and belief propagation to combine predictions from multiple classifiers.
result pRSL achieves state-of-the-art performance on various benchmark datasets.
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…
LATTE tackles heterogeneous network embedding challenges with layer-stacked attention.
problem Aggregating higher-order indirect relations in heterogeneous networks.
method Layer-stacked ATTention Embedding (LATTE) that decomposes meta relations at each layer.
result LATTE achieves state-of-the-art performance on benchmark datasets.
The aim of this paper is to discuss the use of Haar scattering networks, which is a very simple architecture that naturally supports a large number of stacked layers, yet with very few parameters, in a relatively broad set of pattern recognition problems, including regression and classification tasks. This architecture…
Proposes CBMI for missing data imputation using labels and input.
problem Missing data in practical data science settings.
method CBMI: imputes labels and input simultaneously; IUL: stacks label into input.
result CBMI improves classification accuracy, especially for imbalanced and categorical data.
Detection of financial opportunities in micro-blogging data with a stacked classification systemq-fin.ST
System detects financial opportunities in tweets with high precision.
problem Detecting valuable financial insights in micro-blogging data.
method Stacked Machine Learning classification system with NLP features.
result System achieves precision up to 83% in detecting financial opportunities.
GCN and GPCA are mathematically connected, leading to improved node classification performance.
problem Improving node classification performance in semi-supervised settings.
method Established a mathematical connection between GCN and GPCA, demonstrating their equivalence and using this to design an effective initialization strategy.
result GPCA paired with a simple MLP achieves similar or better performance than GCN on semi-supervised node classification tasks.
This research predicts Bitcoin prices using wavelet and deep stacking approach.
problem Predicting price fluctuations of Bitcoin due to its price volatility.
method Wavelet for noise removal, deep learning models (neural networks and transformers), feature selection.
result The model achieved high accuracy in predicting Bitcoin prices at different time intervals.
We investigate unsupervised pre-training of deep architectures as feature generators for "shallow" classifiers. Stacked Denoising Autoencoders (SdA), when used as feature pre-processing tools for SVM classification, can lead to significant improvements in accuracy - however, at the price of a substantial increase in co…
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…
In biomedical research, many different types of patient data can be collected, such as various types of omics data and medical imaging modalities. Applying multi-view learning to these different sources of information can increase the accuracy of medical classification models compared with single-view procedures. Howev…
We explain how to translate several recent results in derived algebraic geometry to derived differential geometry. These concern shifted Poisson structures on NQ-manifolds, Lie groupoids, smooth stacks and derived generalisations, and include existence and classification of various deformation quantisations.
As data streams become more prevalent, the necessity for online algorithms that mine this transient and dynamic data becomes clearer. Multi-label data stream classification is a supervised learning problem where each instance in the data stream is classified into one or more pre-defined sets of labels. Many methods hav…
To construct flexible nonlinear predictive distributions, the paper introduces a family of softplus function based regression models that convolve, stack, or combine both operations by convolving countably infinite stacked gamma distributions, whose scales depend on the covariates. Generalizing logistic regression that…
Constructs cohomology decompositions for symmetric stacks.
problem Cohomology of symmetric stacks.
method Constructs decompositions of cohomology, Borel--Moore homology, and vanishing cycle cohomology.
result Defines BPS cohomology and proves its equivalence to intersection cohomology for smooth stacks.
New neural stack and Turing Machine architectures prove stability and computational power.
problem Designing stable neural network architectures for Turing Machine simulation.
method Introducing neural stack and Turing Machine architectures, proving stability and computational equivalence.
result Differentiable nnTM with bounded neurons can simulate Turing Machine in real-time and is equivalent to UTM.
Classification algorithms to mine data stream have been extensively studied in recent years. However, a lot of these algorithms are designed for supervised learning which requires labeled instances. Nevertheless, the labeling of the data is costly and time-consuming. Because of this, alternative learning paradigms have…
Representation learning, especially which by using deep learning, has been widely applied in classification. However, how to use limited size of labeled data to achieve good classification performance with deep neural network, and how can the learned features further improve classification remain indefinite. In this pa…
Bayesian stacking improves model performance with varying model weights.
problem Improving model predictions with heterogeneous input performance.
method Bayesian hierarchical stacking with varying model weights inferred via Bayesian inference.
result Hierarchical stacking yields better predictions than linear averaging.
Paper combines machine learning and model averaging for robust parameter estimation.
problem Estimating structural parameters with partially unknown functional forms.
method Pairing double/debiased machine learning with stacking for model averaging.
result DDML with stacking is more robust to unknown functional forms than single learners.
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…
In the sentence classification task, context formed from sentences adjacent to the sentence being classified can provide important information for classification. This context is, however, often ignored. Where methods do make use of context, only small amounts are considered, making it difficult to scale. We present a …
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.
problem Decomposing the cohomology of smooth symmetric stacks into invariant parts.
method Using cohomological Hall induction and intersection cohomology of moduli spaces.
result Establishes the BPS decomposition theorem for various symplectic stacks.
Stacked conformal predictionstat.ML
Stacked conformal prediction simplifies model validation.
problem Validating stacked predictive models efficiently.
method Meta-learner at the top of a stacked ensemble for approximate marginal validity.
result The method achieves approximate marginal validity without a separate calibration sample.
Constructs moduli stacks for quiver connections and extends non-Abelian Hodge theory.
problem Extending non-Abelian Hodge theory to moduli stacks of quiver connections.
method Formalizes and constructs moduli stacks of bundles with λ-connections over prestacks.
result Shows moduli stacks are algebraic and locally of finite presentation when base is smooth and projective.
Study connections on Lie groupoids and stacks using Atiyah sequences.
problem No specific problem stated; general connections on Lie groupoids and stacks.
method Construct connections using Atiyah sequences associated with transversal tangential distributions.
result Detailed study and construction of connections on Lie groupoids and stacks.
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…
This paper demonstrates how to apply machine learning algorithms to distinguish good stocks from the bad stocks. To this end, we construct 244 technical and fundamental features to characterize each stock, and label stocks according to their ranking with respect to the return-to-volatility ratio. Algorithms ranging fro…
Constructs moduli stacks of quiver bundles and applies to Higgs bundles.
problem Classifying morphisms of vector bundles over a fixed base.
method General method for constructing moduli stacks of diagrams of vector bundles indexed by a simplicial set.
result Recovery of Nakajima quiver varieties and alternate construction of moduli stacks of Higgs bundles.
New potentials found for sheaves on Calabi-Yau 4-folds.
problem Understanding sheaves on Calabi-Yau 4-folds.
method Derived Quot-stacks and Lagrangian distributions.
result Globally defined -shifted potentials on sheaves.
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…
Classifies singular foliations of a specific type and studies their extensions.
problem Classifying singular foliations of a particular type and understanding their extensions.
method Introduces and classifies singular foliations of -type, proving they are encoded by -th order foliations.
result Singular foliations of -type are encoded by -th order foliations, and these groupoids fiber over certain character stacks.
Stacked LSTM networks improve traffic volume forecasting.
problem Accurate traffic volume prediction for better planning.
method Applying stacked Long Short-Term Memory (LSTM) networks for time series forecasting.
result Stacked LSTM networks enhance the accuracy of traffic volume predictions.
Studies geometric structures on Lie groupoids and differentiable stacks.
problem None explicitly stated in the abstract.
method Various geometric structures and connections on Lie groupoids and differentiable stacks.
result Introduces new concepts like topological groupoid extensions and gerbes over topological stacks.
Multivariate time series classification is a high value and well-known problem in machine learning community. Feature extraction is a main step in classification tasks. Traditional approaches employ hand-crafted features for classification while convolutional neural networks (CNN) are able to extract features automatic…
This paper proposes a novel framework for fusing multi-temporal, multispectral satellite images and OpenStreetMap (OSM) data for the classification of local climate zones (LCZs). Feature stacking is the most commonly-used method of data fusion but does not consider the heterogeneity of multimodal optical images and OSM…
Stacking improves deep neural network training efficiency.
problem Improving the efficiency of training deep neural networks.
method Proposes stacking as a form of accelerated gradient descent.
result Proves stacking provides accelerated training for certain deep linear residual networks.