A new probabilistic polygonal curve representation using Gaussian Mixture Models.
problem Capturing curves with uncertainty in both tangent and normal directions.
method Probabilistic polygonal approximation with Gaussian Mixture Model (GMM).
result The GMM accurately captures the local geometry and uncertainty of curves.
TensorFlow Probability introduces JointDistributions for probabilistic programming.
problem Specifying models in probabilistic programming languages.
method Declarative representations of directed graphical models.
result JointDistributions for TensorFlow Probability.
ProSMIN improves representation quality through probabilistic self-supervised learning.
problem Improving representation quality in self-supervised learning.
method ProSMIN uses two neural networks, online and target, to learn diverse representations through knowledge distillation and a modified scoring rule loss function.
result ProSMIN achieves superior accuracy and calibration on various downstream tasks.
Introduces a probabilistic view of deep learning for better understanding and explaining neural networks.
problem Explaining the behavior and properties of deep neural networks.
method Introduces a probabilistic representation of deep learning, linking neurons, hidden layers, and the whole architecture to Gibbs distributions and Bayesian neural networks.
result Demonstrates the hierarchy and generalization properties of deep learning through a probabilistic lens.
Paper introduces a probabilistic framework for k-shot image classification.
problem Generalizing from a large-scale classification task to a new task with new classes and few examples.
method Leverages feature-based representation and concept information from a neural network, encapsulated in a probabilistic model.
result Simple probabilistic model achieves state-of-the-art performance on k-shot learning datasets.
Researchers develop a new method to learn from incomplete data.
problem Learning from incomplete data with imprecise probabilities.
method Credal sum-product networks (SPNs) for robust probabilistic representations.
result Imprecise SPNs can capture robustness to missing data.
New method improves self-supervised representation learning using probabilistic modeling and Monte Carlo integration.
problem Improving self-supervised representation learning for multimodal data.
method Discriminative probabilistic modeling with multiple importance sampling (MIS) for robust Monte Carlo integration.
result Proposes a novel non-parametric method for approximating conditional probability densities through convex optimization.
Probabilistic FastText captures multiple word senses and sub-word structures.
problem Capturing multiple word senses and sub-word structures in word embeddings.
method Probabilistic FastText uses Gaussian mixture densities to represent words, sharing statistical strength across sub-word structures and capturing different word senses.
result Probabilistic FastText outperforms existing models on word-similarity benchmarks and discerning different meanings.
Probabilistic models learned as density estimators can be exploited in representation learning beside being toolboxes used to answer inference queries only. However, how to extract useful representations highly depends on the particular model involved. We argue that tractable inference, i.e. inference that can be compu…
The paper extends calibration to sets of probabilistic classifiers, finding many ensembles are poorly calibrated.
problem Evaluating the validity of epistemic uncertainty in sets of probabilistic classifiers.
method Proposed a novel nonparametric calibration test for sets of probabilistic classifiers.
result Ensembles of deep neural networks are often not well calibrated.
Simple method disentangles content and style from pre-trained vision models.
problem Learning interpretable features in visual representations.
method Probabilistic linear entanglement model and simple disentanglement algorithm.
result Method provably disentangles content and style features.
ProbETA models travel time correlations between trips for better navigation.
problem Trip correlations not captured by existing methods.
method Deep hierarchical joint probabilistic model with learnable link representations.
result ProbETA outperforms state-of-the-art methods with 12.60% MAPE reduction.
This paper improves DNN generalization by accurately estimating mutual information.
problem Intractability of estimating mutual information in DNNs.
method Introduces a probabilistic representation of DNNs to accurately estimate mutual information.
result Derives a tighter generalization bound than previous relaxations.
In this paper we investigate the virtual string links via a probabilistic interpretation. This representation can be used to distinguish some virtual string links from classical string links. In order to study the algebraic structure behind this probabilistic interpretation we introduce the notion of virtual flat biqua…
TRUST improves structure learning with tractable uncertainty.
problem Capturing uncertainty in structure learning for causal DAGs.
method Probabilistic circuits for posterior inference.
result Probabilistic circuits enhance structure learning quality and uncertainty.
NP-HMC extends HMC for nonparametric models in probabilistic programming.
problem Inference for nonparametric models in probabilistic programming.
method Introduces NP-HMC, a generalization of HMC for nonparametric models using tree representable functions.
result Empirically shows significant performance improvements over existing approaches.
Study non-Markovian singular control problems with probabilistic representation.
problem Non-Markovian singular stochastic control problems.
method Probabilistic representation using Z−constrained BSDEs. result Solution identified with Z−constrained BSDEs for non-singular underlying process. KalMamba improves RL efficiency with probabilistic SSMs.
problem Efficiency in learning and inference for probabilistic SSMs in RL.
method Combines Mamba's scalability with Kalman filtering for efficient probabilistic SSMs.
result KalMamba outperforms state-of-the-art SSMs in RL, especially on longer sequences.
Edward is a flexible probabilistic programming language that integrates with TensorFlow.
problem Probabilistic programming challenges in flexibility and efficiency.
method Compositional representations of random variables and inference, flexible inference methods, integration with TensorFlow.
result Edward achieves significant speedups in probabilistic modeling and inference.
ML-VAE learns disentangled representations from grouped data.
problem Learning disentangled representations from grouped observations with minimal supervision.
method Multi-Level Variational Autoencoder (ML-VAE) that separates latent representation at group and observation levels.
result ML-VAE learns meaningful disentanglement of grouped data and enables manipulation of latent representation.
Proposes a deep probabilistic multi-view model for multi-view learning.
problem Learning from multiple related views with shared latent structure.
method Probabilistic Canonical Correlation Analysis (CCA) in latent space, deep generative networks, variational inference.
result Efficient variational inference approximates posterior distributions of latent multi-view layer.
The paper proves probabilistic alignment between unseen modalities using contrastive learning.
problem Aligning unseen modalities in unsupervised learning.
method Bayesian approach and direct comparison of contrastive representations.
result Direct comparison of contrastive representations recovers the same likelihood ratio as probabilistic graphical models.
Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating system functionality including processes, forking, mutexes, and shared memory. Exploiting this we have …
Paper improves Tm prediction of protein fragments using sparsity and probabilistic models.
problem Improving accuracy of melting temperature prediction for protein fragments.
method Promoting sparsity in pre-trained transformer models and adopting probabilistic frameworks.
result Mean absolute error of 0.23C for predicting melting temperature.
VIR model improves regression accuracy and uncertainty estimation for imbalanced data.
problem Imbalanced regression datasets lead to poor model accuracy and uncertainty estimation.
method VIR model uses probabilistic smoothing and reweighting to estimate latent representations and uncertainty.
result VIR model outperforms state-of-the-art models in accuracy and uncertainty estimation.
Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.
problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.
New method for invariant neural networks using probabilistic symmetries.
problem Improving neural network performance in data-scarce, non-i.i.d., or unsupervised settings.
method Characterizing neural network structures invariant under compact group actions using probabilistic symmetry.
result Established a link between functional and probabilistic symmetry, yielding generative representations of invariant distributions.
Unified probabilistic models improve audio signal processing efficiency and interpretability.
problem High computational cost and difficulty in interpreting probabilistic models in time-frequency analysis.
method Equivalence to Spectral Mixture Gaussian processes, state space representation, Kalman smoothing, efficient parameter learning.
result Unified models make it easier to interpret and modify model assumptions.
Paper develops a dual formulation for PCA in Hilbert spaces.
problem Characterizing probabilistic PCA in Hilbert spaces.
method Dual formulation for probabilistic PCA in Hilbert spaces.
result Generative framework for kernel methods developed.
We explore xor function using copula representations and error surface projections.
problem The exclusive or (xor) function and its approximation problems.
method Probabilistic logic, associative copula functions, and comparison of error surfaces with different activation functions.
result Copula representations extend xor from Boolean to real values.
Unified framework for differentiable graph partitioning with probabilistic cuts.
problem Lack of general guarantees and principled gradients in prior probabilistic relaxations of graph cuts.
method Unified probabilistic framework covering a wide class of cuts, including Normalized Cut, with tight analytic upper bounds.
result Rigorous, numerically stable foundation for scalable, differentiable graph partitioning.
This paper improves probabilistic latent models on hyperbolic spaces.
problem Uncertainty in predictions due to geodesics crossing low-data regions.
method Augmenting hyperbolic manifold with a pullback metric for probabilistic pullback metrics.
result Geodesics on pullback metric respect both geometry and data distribution, reducing uncertainty.
A new unsupervised learning method for high-dimensional data.
problem Challenges in unsupervised learning for AI.
method Contrastive Predictive Coding using autoregressive models and probabilistic contrastive loss.
result Strong performance across four domains: speech, images, text, and reinforcement learning.
Paper adapts and learns movement primitives robustly with probabilistic models.
problem Learning and adapting movement primitives with variability and correlations.
method Prior distributions and general purpose operators for robust parameter estimation and adaptation.
result Robust learning and adaptation achieved with fewer training instances and task-specific heuristics.
The paper shows how to answer future and past questions from high-dimensional time series data.
problem Challenges in answering probabilistic inference questions from high-dimensional time series data.
method Temporal contrastive learning to learn Gaussian representations that enable compact closed-form solutions.
result Representations learned via contrastive learning follow a Gauss-Markov chain, enabling efficient inference and planning.
Efficiently infers cluster assignments in probabilistic models.
problem Efficiently inferring cluster assignments in probabilistic models.
method Amortized approximate Bayesian inference mapping cluster representations into conditional probabilities.
result Parallelizable, yields iid samples with similar computational cost to Gibbs sampling.
The paper proves stabilization in hypersurface sections using Grothendieck rings and probabilistic methods.
problem Stabilization of configuration spaces and Hodge Euler characteristics for hypersurface sections.
method Geometric and cohomological stabilization, probabilistic interpretation, Grothendieck ring analysis.
result Explicit formulas for stable values of Hodge Euler characteristics and point counts.
CAMul forecasts with calibrated and accurate multi-view time-series data.
problem Combining diverse data sources for reliable time-series forecasting.
method CAMul integrates multi-modal data views dynamically, assigning importance based on context.
result CAMul outperforms state-of-the-art models by 25% in accuracy and calibration.
Paper proposes a probabilistic alignment method for domain adaptation.
problem Latent distribution mismatch and miscalibrated uncertainty in adapting large-scale models.
method Bayesian latent transport framework with PAC-Bayesian regularization.
result Reduction in latent manifold discrepancy and improved uncertainty calibration.
The Navier-Stokes equation on a Riemannian manifold is analyzed using Laplace operators.
problem Analyzing the Navier-Stokes equation on a Riemannian manifold.
method Considering Nash embedding, the note elucidates different Laplace operators and obtains a probabilistic formula.
result A probabilistic representation formula for Navier-Stokes equations on a general compact Riemannian manifold is obtained.
SPPL simplifies probabilistic programming for exact inference.
problem Efficient exact inference in probabilistic models.
method SPPL translates probabilistic programs into sum-product expressions, leveraging new techniques for scalability.
result SPPL achieves up to 3500x speedups in exact inference.
MetaVAE learns transferable latent representations across related distributions.
problem Generative models struggle to adapt to new distributions.
method Doubly-amortized variational inference sharing computation across related models.
result MetaVAE significantly outperforms baselines on image classification tasks.
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.
Paper tackles learning probabilistic logic programs for continuous data.
problem Learning meaningful symbolic representations from continuous data.
method Leverages piecewise polynomial function approximation theory for density function learning.
result First steps towards inducing probabilistic logic programs for continuous data.
New method enforces encoder sparsity in HPF for more interpretable feature selection.
problem Lack of encoder sparsity in HPF leads to lack of column-clustering property.
method Enforces encoder sparsity using a generalized additive model (GAM).
result Gains ability to perform feature selection and relates each representation to original features.
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic topic models, STC relaxes the normalization constraint of admixture proportions and the constraint of defining a normalized likelihood functio…
GeoTrackNet detects maritime anomalies from AIS tracks using neural networks and a contrario detection.
problem Detecting anomalies in maritime traffic patterns for better situational awareness.
method Probabilistic neural network representation of AIS tracks and a contrario detection.
result Demonstrated relevance compared to state-of-the-art schemes on a large AIS dataset.
New method learns interaction-aware orderbook representation for better intraday electricity price forecasting.
problem Challenges in probabilistic intraday electricity price forecasting due to dynamic orderbook microstructure.
method OrderFusion: an end-to-end and parameter-efficient probabilistic forecasting model that learns interaction-aware representation of buy-sell dynamics.
result Consistent improvements over conventional baselines in probabilistic forecasting of CID price indices.