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,695 papers · 148 categories

Trend · papers per month

17355269 · Jun 202019922001200920172026
48 results for ICM Ensemble

In this paper, we prove that the Morse index of a multiplicity one, smooth, min-max minimal hypersurface is generically equal to the dimension of the homology class detected by the families used in the construction. This confirms part of the program (\cite{marques-icm}, \cite{marques-neves-cycles}, \cite{marques-neves-…

2018-03-12abs ↗pdf ↗

Capsule Networks (CapsNets) have been proposed as an alternative to Convolutional Neural Networks (CNNs). This paper showcases how CapsNets are more capable than CNNs for autonomous agent exploration of realistic scenarios. In real world navigation, rewards external to agents may be rare. In turn, reinforcement learnin…

2020-02-08abs ↗pdf ↗

The postulate of independence of cause and mechanism (ICM) has recently led to several new causal discovery algorithms. The interpretation of independence and the way it is utilized, however, varies across these methods. Our aim in this paper is to propose a group theoretic framework for ICM to unify and generalize the…

2017-05-05abs ↗pdf ↗

Graph Convolutional Networks improve prosthetic sensation interpretation.

problem Improving neuroprosthetic performance and sensory information stability.
method Applied Graph Convolutional Networks (GCNs) to interpret neuronal spiking activity.
result GCN model achieved 73.5% performance on ordinal regression task.

New framework improves model robustness by focusing on stable relations across environments.

problem Standard supervised learning fails under data distribution shift.
method Gradient-based learning framework derived from the principle of independent causal mechanisms (ICM).
result Models generalize well to unseen scenarios, ignoring unstable relations.

Using results of Gathmann, we prove the following theorem: If a smooth projective variety X has generically semisimple (p,p)-quantum cohomology, then the same is true for the blow-up of X at any number of points. This a successful test for a modified version of Dubrovin's conjecture from the ICM 1998.

2004-03-16abs ↗pdf ↗

Floer homology is a good example of homological invariants living in the infinite dimension. We suggest a way to construct this kind of invariants using only soft essentially finite-dimensional tools; no hard analysis or PDE is involved. This work is partially inspired by the M. Gromov's survey ``Soft and hard symplect…

2020-01-15abs ↗pdf ↗

This paper formalizes manifolds in positive characteristic varieties.

problem Establishing l-adic formal manifold structures on positive characteristic varieties.
method Develops and proves the existence of l-adic formal manifold structures and abelianized Galois symmetries.
result Proves l-adic homotopic equivalence and l-local lifting for simply-connected varieties.

New bounds show triangulated surfaces are evenly distributed in moduli space.

problem Distribution of triangulated surfaces in moduli space as genus increases.
method Proved upper and lower bounds for the number of triangulated surfaces in Teichmüller balls.
result Number of triangulated surfaces in a Teichmüller unit ball is at most exponential in the number of triangles, independent of genus.

DeepICMGP surrogate models multiple outputs efficiently.

problem Challenges in modeling dependencies between multiple outputs using traditional multi-output GPs.
method Introduces hierarchical coregionalization structures across layers in DGPs.
result Demonstrates competitive performance and active learning strategies.

New framework learns disentangled causal representations from observed labels.

problem Learning meaningful disentangled causal representations from observed data.
method ICM-VAE framework using flow-based diffeomorphic functions and causal disentanglement prior.
result Induces highly disentangled causal factors and improves robustness.

Nonlinear analysis has played a prominent role in the recent developments in geometry and topology. The study of the Yang-Mills equation and its cousins gave rise to the Donaldson invariants and more recently, the Seiberg-Witten invariants. Those invariants have enabled us to prove a number of striking results for low …

2002-12-01abs ↗pdf ↗

Overparameterized ensembles don't offer generalization benefits over single large models.

problem Theoretical limitations of ensembles in overparameterized settings.
method Using ensembles of random feature (RF) regressors, the paper clarifies how modern ensembles differ from underparameterized counterparts.
result Infinite ensembles of overparameterized RF regressors become pointwise equivalent to single infinite-width RF regressors, and finite width ensembles converge to single models with the same parameter budget.

New method creates diverse neural ensembles for better uncertainty estimation and robustness.

problem Creating more robust neural networks for uncertainty estimation and dataset shift.
method Automatically constructing ensembles with varying architectures.
result Ensembles with varying architectures outperform deep ensembles in accuracy, uncertainty calibration, and robustness.

New method certifies joint adversarial robustness of model ensembles.

problem Ensuring robustness of model ensembles against adversarial attacks.
method Proposes a novel technique to certify joint robustness, building on prior work on single-model robustness certification.
result Demonstrates the effectiveness of certifying joint robustness of ensembles, improving understanding of ensemble defenses.

Embedded ensembles improve neural network performance efficiently.

problem Improving neural network performance with fewer resources.
method Analyzing the wide network limit of gradient descent dynamics using Neural-Tangent-Kernel.
result Embedded ensembles exhibit two regimes: independent and collective, affecting performance.

Study pitfalls of deep learning ensembles in uncertainty estimation.

problem Pitfalls in in-domain uncertainty estimation and ensembling in deep learning.
method Exploration of standards for uncertainty quantification and broad study of ensembling techniques.
result Many sophisticated ensembling techniques are equivalent to a simple ensemble of few networks.

New hyperparameter ensembles boost neural network performance and uncertainty.

problem Improving neural network robustness and uncertainty quantification.
method Designing ensembles over both weights and hyperparameters, stratified across random initializations.
result Hyper-deep and hyper-batch ensembles outperform deep and batch ensembles on various architectures.

Bayesian deep ensembles improve prediction accuracy in various settings.

problem Improving prediction accuracy of deep ensembles in out-of-distribution settings.
method Introducing a randomised, untrainable function to each ensemble member, enabling a posterior predictive distribution interpretation.
result Bayesian deep ensembles make more conservative predictions and outperform standard ensembles in various tasks.

RCAM-based ensemble combines binary classifiers using similarity and vote scheme.

problem Improving binary classification accuracy through ensemble methods.
method RCAM-based ensemble combining classifiers using similarity and recurrent consult-vote scheme.
result RCAM-based ensemble outperforms individual classifiers and majority voting.

High-capacity neural network ensembles often benefit more from high-capacity models than from increased diversity.

problem The performance of high-capacity neural network ensembles is often harmed by interventions that promote predictive diversity.
method A large-scale study of nearly 600 neural network classification ensembles, examining various interventions and architectures.
result Discouraging predictive diversity can be benign in large-network ensembles, and higher-capacity models often yield better performance than diverse architectures.

New method reduces ensemble size for linear bandits, achieving near optimal regret.

problem Achieving near optimal regret in linear bandits with limited ensemble size.
method Ensemble sampling with a size of order dlogTd \log T for a dd-dimensional stochastic linear bandit.
result Regret is at most (dlogT)5/2T(d \log T)^{5/2} \sqrt{T}, improving over linear scaling with TT.

Jointly tuning ensemble models improves performance and uncertainty calibration.

problem Improving both predictive performance and uncertainty calibration in deep ensembles.
method Investigated the impact of jointly tuning weight decay, temperature scaling, and early stopping.
result Jointly tuning ensemble models generally matches or improves performance, with significant variation across tasks.

Paper analyzes uncertainty metrics in ensemble learning for healthcare AI.

problem Selecting appropriate uncertainty metrics for ensemble learners in healthcare AI.
method Rigorous analysis of two uncertainty metrics: ensemble mean and variance.
result Ensemble mean is preferable to ensemble variance for decision making in healthcare AI.

We propose and evaluate alternative ensemble schemes for a new instance based learning classifier, the Randomised Sphere Cover (RSC) classifier. RSC fuses instances into spheres, then bases classification on distance to spheres rather than distance to instances. The randomised nature of RSC makes it ideal for use in en…

2014-09-17abs ↗pdf ↗

Ensemble++ uses shared-factor ensembles to scale Thompson Sampling for linear and nonlinear bandits.

problem Computational challenges in Thompson Sampling for large-scale or non-conjugate settings.
method Ensemble++ with shared-factor architecture and random linear combinations.
result Ensemble++ achieves comparable regret to exact Thompson Sampling with significantly smaller ensemble sizes.

Ensemble unsupervised anomaly detection using IRT for hidden ground truth.

problem Challenges in constructing an ensemble from unsupervised anomaly detection methods.
method Use Item Response Theory to compute latent traits and construct an ensemble that downplays noisy methods.
result Demonstrated effectiveness of IRT ensemble on extensive data repository.

Efficient neural network ensembles improve image classification reliability and uncertainty quantification.

problem Uncertainty in neural network predictions for industrial image classification.
method Investigated efficient neural network ensembles (snapshot, batch, multi-input multi-output) for image classification reliability and uncertainty quantification.
result Batch ensemble is a cost-effective and competitive alternative to deep ensembles, offering savings in training and test time.

Ensembles of deep neural networks significantly improve generalization accuracy. However, training neural network ensembles requires a large amount of computational resources and time. State-of-the-art approaches either train all networks from scratch leading to prohibitive training cost that allows only very small ens…

2018-09-12abs ↗pdf ↗

Paper analyzes ensemble Kalman updates for effective dimension and localization.

problem Why small ensemble sizes work well in inverse problems and data assimilation.
method Non-asymptotic analysis of ensemble Kalman updates, focusing on effective dimension and localization.
result Rigorously explains why a small ensemble size is sufficient when prior covariance has moderate effective dimension.