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

Trend · papers per month

4896143191 · Jun 202019922001200920172026
48 results for probabilistic perspective

Proposes a probabilistic method for generating semantically-aware adversarial examples.

problem Generating adversarial examples that are difficult for humans to detect while preserving semantics.
method Embeds subjective understanding of semantics as a distribution into adversarial example generation.
result Achieves higher success rates in circumventing adversarial defense mechanisms.

The paper investigates model collapse in language models from a probabilistic perspective.

problem Understanding and preventing model collapse in language model training.
method Investigates recursive parametric model training from a probabilistic standpoint, characterizing conditions for model collapse and proposing mitigation strategies.
result Progressively increasing sample size is necessary to prevent model collapse, with a superlinear growth rate required in the asymptotic regime.

We present a new algorithm for approximate inference in probabilistic programs, based on a stochastic gradient for variational programs. This method is efficient without restrictions on the probabilistic program; it is particularly practical for distributions which are not analytically tractable, including highly struc…

2013-01-07abs ↗pdf ↗

We present a general probabilistic perspective on Gaussian filtering and smoothing. This allows us to show that common approaches to Gaussian filtering/smoothing can be distinguished solely by their methods of computing/approximating the means and covariances of joint probabilities. This implies that novel filters and …

2010-06-10abs ↗pdf ↗

This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.

problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.

Probabilistic programming languages represent complex data with intermingled models in a few lines of code. Efficient inference algorithms in probabilistic programming languages make possible to build unified frameworks to compute interesting probabilities of various large, real-world problems. When the structure of mo…

2016-07-04abs ↗pdf ↗

Unified framework for learning flexible probabilistic programs using DPP and PAC-Bayes bounds.

problem Learning and generalizing from complex probabilistic models.
method Unified DPP representation and PAC-Bayes bounds for stochastic programs.
result Improved performance and generalization prediction using flexible DPP model representations and learned complexity measures.

We prove that the Euler form of a metric connection on real oriented vector bundle EE over a compact oriented manifold MM can be identified, as a current, with the expectation of the random current defined by the zero-locus of a certain random section of the bundle. We also explain how to reconstruct probabilisticall…

2014-04-21abs ↗pdf ↗

Normalizing flows provide a general mechanism for defining expressive probability distributions, only requiring the specification of a (usually simple) base distribution and a series of bijective transformations. There has been much recent work on normalizing flows, ranging from improving their expressive power to expa…

2019-12-05abs ↗pdf ↗

Unified framework for Gaussian process methods in differential equations.

problem Fragmented approaches to Gaussian process methods in differential equations.
method Unified Bayesian perspective integrating differential equation constraints.
result Consolidation of existing methods and foundation for future research.

This work offers a broad perspective on probabilistic modeling and inference in light of recent advances in probabilistic programming, in which models are formally expressed in Turing-complete programming languages. We consider a typical workflow and how probabilistic programming languages can help to automate this wor…

2018-10-02abs ↗pdf ↗

Adversarial attacks on probabilistic state-space models affect latent state and policy decisions.

problem Robust reinforcement learning under adversarial observability.
method Analyzing adversarial attacks on linear probabilistic state-space models.
result Demonstrating the influence of adversarial observations on latent state and policy decisions.

Study on stability of GCNNs under graph perturbations.

problem Limited theoretical understanding of GCNN stability.
method Proposes a probabilistic framework to analyze GCNN stability under various graph perturbations.
result Demonstrates the importance of data distribution in stability analysis.

Bayesian symbolic regression automates model discovery from data.

problem Learning closed-form mathematical models from data using heuristic methods.
method Probabilistic approach to symbolic regression, connecting to information theory and statistical physics.
result Probabilistic approach provides model plausibility and performance guarantees.

Capsule models enforce object pose relationships for robustness, explored with probabilistic generative and variational methods.

problem Enforcing object pose relationships for robustness to viewpoint changes.
method Probabilistic generative model with variational bound, exploring capsule assumptions and inference mechanisms.
result Unified objective and test time optimisation demonstrated for capsule models.

ProGen improves spatiotemporal forecasting with SDEs and diffusion models.

problem Complex spatial and temporal dependencies in spatiotemporal data.
method ProGen uses Stochastic Differential Equations and diffusion-based generative models.
result ProGen outperforms state-of-the-art models on traffic datasets.

The paper studies batch decompositions of random datasets with probabilistic similarity constraints.

problem Understanding how to optimally split large datasets into batches for better model learning.
method Assumes independent data points from a space, defines similarity, and uses probabilistic and martingale methods to find bounds on batch sizes.
result Demonstrates an inherent tradeoff between relaxing similarity constraints and batch size, and provides bounds for maximum similarity subsets.

This paper investigates how synthetic data and overparameterization improve VAE generalization.

problem Improving generalization performance of Variational Autoencoders (VAEs).
method Investigates the effectiveness of synthetic data and overparameterization in VAEs.
result Training on synthetic data and using more parameters improves VAE generalization, inference, and robustness.

The paper connects disentanglement to manifold charts and commutativity.

problem Discovering local charts of the data manifold for disentanglement.
method Interpreting disentanglement as local charts of the data manifold and studying commutativity.
result Commutativity is a central property in disentanglement, as shown in manifold, group theoretic, and probabilistic frameworks.

In this work, we introduce a novel probabilistic representation of deep learning, which provides an explicit explanation for the Deep Neural Networks (DNNs) in three aspects: (i) neurons define the energy of a Gibbs distribution; (ii) the hidden layers of DNNs formulate Gibbs distributions; and (iii) the whole architec…

2019-08-26abs ↗pdf ↗

Unified probabilistic foundation for fuzzy simplicial sets in dimensionality reduction.

problem Lack of clear probabilistic interpretation in fuzzy simplicial sets.
method Introducing a probabilistic framework explaining fuzzy simplicial sets as marginals of probability measures on simplicial sets.
result Unified probabilistic theoretical foundation for fuzzy simplicial sets.

In this paper we explore the "vector semantics" problem from the perspective of "almost orthogonal" property of high-dimensional random vectors. We show that this intriguing property can be used to "memorize" random vectors by simply adding them, and we provide an efficient probabilistic solution to the set membership …

2018-02-23abs ↗pdf ↗

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.

Optimal control of stochastic nonlinear dynamical systems is a major challenge in the domain of robot learning. Given the intractability of the global control problem, state-of-the-art algorithms focus on approximate sequential optimization techniques, that heavily rely on heuristics for regularization in order to achi…

2019-10-07abs ↗pdf ↗

ICON learns differential equation operators from examples, revealing probabilistic inference.

problem Learning operators for differential equations from limited examples.
method Probabilistic operator learning using ICON architectures trained on diverse datasets.
result ICON implicitly performs Bayesian inference on solution operators.

We consider probabilistic PCA and related factor models from a Bayesian perspective. These models are in general not identifiable as the likelihood has a rotational symmetry. This gives rise to complicated posterior distributions with continuous subspaces of equal density and thus hinders efficiency of inference as wel…

2019-05-12abs ↗pdf ↗

Treating neural network inputs and outputs as random variables, we characterize the structure of neural networks that can be used to model data that are invariant or equivariant under the action of a compact group. Much recent research has been devoted to encoding invariance under symmetry transformations into neural n…

2019-01-18abs ↗pdf ↗

Recent advances in analysis of subband amplitude envelopes of natural sounds have resulted in convincing synthesis, showing subband amplitudes to be a crucial component of perception. Probabilistic latent variable analysis is particularly revealing, but existing approaches don't incorporate prior knowledge about the ph…

2018-02-02abs ↗pdf ↗

Study proposes a multi-agent framework to mitigate bias in sentiment analysis.

problem Bias in sentiment analysis models.
method Integrates multiple LLMs, incorporates dialogue sessions, and uses probabilistic prediction.
result KCS+IBC reduces entropy and increases variance, suggesting improved balance between aggregation and diversity.