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

Trend · papers per month

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for support propagation

We introduce propagation kernels, a general graph-kernel framework for efficiently measuring the similarity of structured data. Propagation kernels are based on monitoring how information spreads through a set of given graphs. They leverage early-stage distributions from propagation schemes such as random walks to capt…

2014-10-13abs ↗pdf ↗

Constructs a support-preserving homotopy for differential forms with boundary decay estimates.

problem Non-uniqueness of chain homotopies in de Rham complexes with boundary decay properties.
method Constructs a specific chain homotopy with desirable support propagation and boundary decay estimates.
result Obtains a support-preserving right inverse of the divergence operator with optimal decay estimates.

Develops a new approach to study nonlinear PDEs and their singularities.

problem Understanding the propagation domains of solutions to nonlinear PDEs.
method Derived geometric machinery and sheaf theory to study nonlinear PDEs and their singular supports.
result Estimates the domains of propagation for solutions of non-linear systems.

Decoupled GCN is shown to be equivalent to label propagation.

problem Improving semi-supervised node classification in graph learning.
method The paper proves the equivalence of decoupled GCN and label propagation, and proposes a new method named PTA.
result Decoupled GCN is equivalent to two-step label propagation and can automatically assign weights to pseudo-labels.

GEnBP combines EnKF and GaBP for efficient high-dimensional inference.

problem Efficient inference in high-dimensional models.
method Gaussian Ensemble Belief Propagation algorithm combining EnKF and GaBP.
result GEnBP outperforms existing methods in accuracy and efficiency.

We prove the equivalence of several natural notions of conformal maps between sub-Riemannian manifolds. Our main contribution is in the setting of those manifolds that support a suitable regularity theory for subelliptic pp-Laplacian operators. For such manifolds we prove a Liouville-type theorem, i.e., 1-quasiconform…

2016-03-17abs ↗pdf ↗

The paper proposes a new framework for accurate uncertainty representation and propagation.

problem Inaccurate representation and propagation of uncertainty in measurement systems.
method The paper introduces a comprehensive framework using Gaussian Mixture Models (GMMs) for representing and propagating quantitative attributes in measurement systems.
result GMMs offer improved accuracy in representing and propagating measurement uncertainty compared to traditional Gaussian methods, while maintaining computational tractability.

This paper considers the problem of inferring image labels from images when only a few annotated examples are available at training time. This setup is often referred to as low-shot learning, where a standard approach is to re-train the last few layers of a convolutional neural network learned on separate classes for w…

2017-06-07abs ↗pdf ↗

We address the problem of estimating statistics of hidden units in a neural network using a method of analytic moment propagation. These statistics are useful for approximate whitening of the inputs in front of saturating non-linearities such as a sigmoid function. This is important for initialization of training and f…

2018-03-28abs ↗pdf ↗

The time complexity of support vector machines (SVMs) prohibits training on huge data sets with millions of data points. Recently, multilevel approaches to train SVMs have been developed to allow for time-efficient training on huge data sets. While regular SVMs perform the entire training in one -- time consuming -- op…

2018-08-20abs ↗pdf ↗

Endogenous business cycles explain higher comovement across countries.

problem Standard models struggle to explain high comovement in business cycles across countries.
method Developed a demand-driven reduced-form model with strategic complementarities and international trade linkages.
result Combining endogenous business cycles with exogenous shocks matches empirical comovement levels.

We study the existence of D-brane bound states at threshold in Type II string theories. In a number of situations, we can reduce the question of existence to quadrature, and the study of a particular limit of the propagator for the system of D-branes. This involves a derivation of an index theorem for a family of non-F…

1997-05-08abs ↗pdf ↗

Study reveals significant performance flips in GLOD using repurposed graph classification datasets.

problem Performance discrepancies in graph-level outlier detection using repurposed classification datasets.
method Repurposed binary classification datasets for GLOD; analyzed ROC-AUC performance.
result Performance of GLOD models significantly flips depending on which class is down-sampled.

Gaussian processes (GP) are attractive building blocks for many probabilistic models. Their drawbacks, however, are the rapidly increasing inference time and memory requirement alongside increasing data. The problem can be alleviated with compactly supported (CS) covariance functions, which produce sparse covariance ma…

2012-03-15abs ↗pdf ↗

Optimization-based pruning eliminates backpropagation for large language models.

problem Suboptimal pruning performance due to heuristic metrics.
method Optimization of Bernoulli distribution to learn pruning masks without backpropagation.
result Efficient pruning of large language models with improved performance.

Paper uses PCE to quantify ML model and input uncertainties.

problem Accurately quantify and propagate combined uncertainties in ML predictions.
method Polynomial Chaos Expansion (PCE) for joint input and model uncertainty.
result Efficient and accurate calculation of output variability and sensitivity.

Due to the extremely volatile nature of financial markets, it is commonly accepted that stock price prediction is a task full of challenge. However in order to make profits or understand the essence of equity market, numerous market participants or researchers try to forecast stock price using various statistical, econ…

2018-05-29abs ↗pdf ↗

Wide neural networks learn features under μμP, identifying weights and decomposing support.

problem Feature learning in wide neural networks under μμP.
method Proving mean-field limit, characterizing identifiability, sparse-dictionary decomposition, and feature-learning-error decomposition.
result The triple (w,Dorb,S)(w^*, D^*_{\mathrm{orb}}, S^*) identifies the natural learning cell of the architecture-data pair (σ,ρ)(σ, ρ).

The paper derives uncertainty quantification for ML models used in metrology.

problem Uncertainty quantification for ML models in metrology applications.
method Analytical expressions for mean and variance of model output are derived for various ML models.
result The derived expressions cover multiple ML models and are validated against Monte Carlo methods.

Bayesian method for multivariate autoregressive models with exogenous inputs.

problem Estimating uncertainties in autoregressive models with exogenous inputs.
method Recursive Bayesian estimation via message passing in a factor graph.
result Produces full posterior distributions for autoregressive coefficients and noise precision.

A susceptibility propagation that is constructed by combining a belief propagation and a linear response method is used for approximate computation for Markov random fields. Herein, we formulate a new, improved susceptibility propagation by using the concept of a diagonal matching method that is based on mean-field app…

2017-12-01abs ↗pdf ↗

When studying the causal propagation of a field in a globally hyperbolic spacetime M, one often wants to express the physical intuition that it has compact support in spacelike directions, or that its support is a spacelike compact set. We compare a number of logically distinct formulations of this idea, and of the com…

2012-11-11abs ↗pdf ↗

Variational inference is a powerful concept that underlies many iterative approximation algorithms; expectation propagation, mean-field methods and belief propagations were all central themes at the school that can be perceived from this unifying framework. The lectures of Manfred Opper introduce the archetypal example…

2014-09-22abs ↗pdf ↗

This paper proposes an alternating back-propagation algorithm for learning the generator network model. The model is a non-linear generalization of factor analysis. In this model, the mapping from the continuous latent factors to the observed signal is parametrized by a convolutional neural network. The alternating bac…

2016-06-28abs ↗pdf ↗

Unified model combines feature and label propagation for semi-supervised classification.

problem Combining feature and label propagation for effective semi-supervised classification.
method Unified Message Passing Model (UniMP) using Graph Transformer and masked label prediction.
result Obtains new state-of-the-art results in Open Graph Benchmark (OGB).

In this work, we address the problem of solving a series of underdetermined linear inverse problems subject to a sparsity constraint. We generalize the spike-and-slab prior distribution to encode a priori correlation of the support of the solution in both space and time by imposing a transformed Gaussian process on the…

2015-09-15abs ↗pdf ↗

This thesis investigates belief propagation's performance in graphical models with loops.

problem Belief propagation's performance and convergence guarantees in models with loops are uncertain.
method Investigates how model parameters affect belief propagation's performance, convergence, and approximation quality.
result Model parameters influence the number of fixed points, convergence properties, and approximation quality of belief propagation.

LNPE enhances local connections in embeddings using extended neighbor propagation.

problem Improving local connections and interactions in nonlinear dimensionality reduction.
method Inspired by GCN, LNPE extends 1-hop neighbors to n-hop neighbors in LLE.
result LNPE produces more faithful and robust embeddings with better topological and geometrical properties.

The back-propagation algorithm is the cornerstone of deep learning. Despite its importance, few variations of the algorithm have been attempted. This work presents an approach to discover new variations of the back-propagation equation. We use a domain specific lan- guage to describe update equations as a list of primi…

2018-08-08abs ↗pdf ↗