Overview of latent variable models in probabilistic frameworks.
problem Understanding the interconnectedness of latent variable models.
method Conceptual overview emphasizing compositional nature.
result Emphasizes the interconnectedness of latent variable models.
A probabilistic framework for online test-time adaptation
problem Adapting models to new data under distributional shift
method State-space modelling architecture
result Characterizing parameter learning, time evolution, prior tuning, and prediction
Unified probabilistic framework for nonlinearities in neural networks.
problem Lack of a unified approach to incorporating nonlinearities in neural networks.
method Doubly truncated Gaussian distributions for generating various nonlinearities.
result Performance improvements in RBM, temporal RBM, and TGGM when nonlinearities are learned alongside weights.
Develops a neural framework for probabilistic forecasting of dynamical systems.
problem Uncertainty quantification in dynamical systems using trajectory-oriented approaches.
method D2D neural probabilistic forecasting framework using kernel mean embeddings and mixture density networks.
result The D2D model captures distributional evolution in chaotic systems and produces skillful probabilistic forecasts.
Extends DeTEcT framework for token economies with dynamic and probabilistic parameters.
problem Modeling wealth distribution in token economies with dynamic and probabilistic parameters.
method Introduces four parametrization techniques: dynamic vs static, probabilistic vs non-probabilistic.
result Derives existing wealth distribution models from DeTEcT framework with added restrictions.
New framework uses cohomology to analyze probabilistic distortions and arbitrage.
problem Analyzing probabilistic distortions and arbitrage in categorical filtrations.
method Transport cohomological framework, simplicial structure, loop effects, holonomy.
result Nontrivial probabilistic distortions and obstructions generated by loops.
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.
A new framework for probabilistic learning using Maximum Probability Theorem.
problem Challenges in defining and quantifying model probabilities in probabilistic learning.
method Introduces a new probabilistic framework based on Maximum Probability Theorem, defining models as events with quantified probability measures.
result The probability of a model is invariant to reparameterization and depends solely on the likelihood function.
The paper studies the concepts of hedging and arbitrage in a non probabilistic framework. It provides conditions for non probabilistic arbitrage based on the topological structure of the trajectory space and makes connections with the usual notion of arbitrage. Several examples illustrate the non probabilistic arbitrag…
ProbDR framework interprets DR algorithms as probabilistic inference.
problem Efficiently compressing high-dimensional data into lower dimensions.
method ProbDR variational framework that treats DR as probabilistic inference.
result ProbDR unifies various DR algorithms and enables probabilistic reasoning.
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.
A new model detects objects more efficiently with less computation.
problem Handling waste of regional information and compromise between efficiency and accuracy in CNN object detection.
method Proposes a probabilistic model with a search framework to map images into probabilistic object distributions.
result The proposed model gives more informative outputs with less computation.
Framework uses probabilistic programming for physics simulation in games.
problem Efficiently simulate physics in games using probabilistic programming.
method Combines model-free and model-based approaches to improve efficiency.
result Model outperforms model-free or model-based approaches alone.
A new probabilistic mixup framework improves deep learning generalization.
problem Improving deep learning generalization performance.
method Introduces a novel probabilistic mixup framework for conditional density estimation.
result Empirical results show benefits over existing mixup variants.
A framework assesses the trustworthiness of probabilistic classifiers using local calibration error.
problem Assessing the trustworthiness of probabilistic classifiers beyond traditional metrics.
method I-trustworthy framework linking local calibration to trustworthiness; Kernel Local Calibration Error (KLCE) method for hypothesis testing.
result The effectiveness of the proposed test statistic demonstrated through simulated and real-world datasets.
Unified probabilistic gradient boosting for entire conditional distribution modeling.
problem Creating accurate probabilistic forecasts from regression tasks.
method Unified probabilistic gradient boosting framework using XGBoost and LightGBM, modeling conditional moments or CDF via Normalizing Flows.
result Achieves state-of-the-art forecast accuracy.
Unified framework for sequential decision making using meta-learning surrogate models.
problem Sequential decision making problems in various domains.
method Probabilistic model-based approach with meta-learning for data-efficient adaptation.
result Efficient and general black-box learning approach across different problem domains.
Paper presents a probabilistic framework for diffusion synchronization.
problem Improper application of heuristics leads to suboptimal results in diffusion synchronization.
method Develops a probabilistic framework to analyze and adapt correlation models for each specific task.
result Achieves better results by identifying optimal correlation models per task.
A new ML framework for efficient probabilistic inference.
problem Efficient and versatile learning with limited data.
method ML-PIP framework and VERSA method for meta-learning probabilistic inference.
result Sets new state-of-the-art results on benchmark datasets.
ProMoD models human race drivers with probabilistic movement primitives and neural networks.
problem Challenging task of modeling human driver behavior due to variability and complexity.
method Modular framework with Probabilistic Movement Primitives, clothoids, and neural networks.
result Significant advantages in imitation accuracy and robustness compared to other algorithms.
New method creates personalized brain atlases from large datasets.
problem Limited generalizability and spatial specificity of traditional probabilistic atlases.
method Data-driven clustering of regions using point distribution models.
result Personalized probabilistic atlases adapt quickly to new subjects.
Unified approach for sequence design combining likelihood-free inference and black-box optimization.
problem Designing biological sequences efficiently and accurately.
method Unified probabilistic framework integrating likelihood-free inference and black-box optimization.
result Previous optimization methods can be adapted and new algorithms proposed within this framework.
Paper proposes a framework for probabilistic load forecasting by integrating point forecasts.
problem Short-term load forecasting for power systems energy management.
method Two-stage framework: first stage for point forecasting, second stage for probabilistic forecasting using feature integration.
result Numerical results show effectiveness of the proposed approach in hour-ahead load forecasting.
Pyro enables scalable AI models using probabilistic programming.
problem Developing complex probabilistic models for large datasets.
method Stochastic variational inference, PyTorch, Poutine.
result Pyro supports scalable AI models with high-dimensional data.
We develop a probabilistic consumer choice framework based on information asymmetry between consumers and firms. This framework makes it possible to study market competition of several firms by both quality and price of their products. We find Nash market equilibria and other optimal strategies in various situations ra…
Paper proposes a unified framework for evaluating calibration of probabilistic models.
problem Evaluation of calibration for general probabilistic predictive models.
method Unified framework for calibration evaluation and tests for any probabilistic model.
result Generalization and reformulation of existing measures and tests.
A probabilistic framework optimizes kernel adaptive filters for better performance.
problem Improving the performance of kernel adaptive filters.
method Formulating a probabilistic model with prior distributions over weights, dictionaries, and kernel parameters. Using gradient-based maximum-a-posteriori optimisation and Markov chain Monte Carlo methods.
result The framework outperformed standard KAFs in terms of mean square error and dictionary sparsity.
Convolutional neural network for probabilistic time series forecasting.
problem Forecasting multiple related time series with complex patterns.
method Temporal convolutional neural network with stacked residual blocks and dilated causal convolution.
result Outperforms state-of-the-art methods in accuracy and efficiency.
MultiVerse uses importance sampling for efficient causal reasoning in probabilistic programming.
problem Efficient causal reasoning in probabilistic models, especially counterfactual inference.
method Native implementation of importance sampling in probabilistic programming, optimizing inference through query structure.
result Significant optimisation of inference process through careful design choices and query structure consideration.
Develops inference combinators for probabilistic programs using neural networks.
problem Creating efficient proposals for probabilistic program inference.
method Inference combinators using neural network parameterization of proposals.
result Correct by construction variational methods tailored to specific models.
Deployable probabilistic programming for Go and other languages.
problem Adding probabilistic programming to mainstream languages.
method Design guidelines and Infergo implementation for Go.
result Infergo demonstrates performance and applicability in various use cases.
DIN framework directly models hydraulic conductivity and uncertainty.
problem Modeling hydraulic conductivity and uncertainty in groundwater flow.
method DIN utilizes DDPM as a prior learner, incorporating observational data through conditional injection mechanisms.
result DIN generates multiple constraint-satisfying realizations and accurate uncertainty quantification.
PNCs balance tractability and expressiveness in probabilistic modeling.
problem Balancing tractability and expressiveness in probabilistic models.
method Introduce probabilistic neural circuits (PNCs) as a mix of Bayesian networks and neural networks.
result PNCs are powerful function approximators.
Functional tensors unify probabilistic programming with automatic differentiation.
problem Designing probabilistic programming systems that can handle diverse inference strategies.
method Introducing functional tensors that capture benefits of tensors and continuous probability distributions.
result Functional tensors enable parallel exact inference for various modeling motifs.
New framework for probabilistic linear solvers reduces manual effort.
problem Manual implementation of probabilistic iterative methods is laborious.
method Affine Tracing: Automatically constructs PIMs from standard implementations.
result Any realistic affine PIM is calibrated, motivating their adoption.
Hybrid framework combines PGMs and TNs for complex probabilistic modeling.
problem Combining quantum-like correlations into PGM models.
method Introducing decoherence to convert probabilistic TN models into PGMs.
result Hybrid models can represent and combine strengths of both PGMs and TNs.
Framework for assessing and comparing prediction strategies with uncertainty.
problem Statistical uncertainty in black-box prediction strategies.
method Formal probabilistic supervised learning framework.
result New algorithms and meta-algorithms for fair comparison of prediction strategies.
A new framework for robot block-stacking tasks using causal probabilistic models.
problem Robots fail outside controlled environments due to uncertainty and lack of explicit design for all scenarios.
method Causal probabilistic framework combining causal models and probabilistic representations of noise.
result Robots can perceive, reason about, and explain their environment for block-stacking tasks.
New method for efficient probabilistic deep state-space models.
problem Efficient inference for probabilistic deep state-space models.
method Deterministic inference algorithm for ProDSSM with neural network weights.
result Superior balance between predictive performance and computational budget.
We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministi…
A new framework speeds up Bayesian inference in probabilistic programs.
problem Efficient Bayesian inference in complex probabilistic programs.
method Embeds a sampler within a refined variational posterior approximation, using automatic differentiation for parameter tuning.
result Significantly speeds up mixing time and improves efficiency in various probabilistic program tasks.
Unified framework for supervised classification with diverse training data.
problem Handling different types of training data for supervised classification.
method Generalized robust risk minimization (GRRM) with probabilistic transformations.
result GRRM can handle various training data types and new supervision schemes.
A-NeSI scales approximate inference for probabilistic neurosymbolic learning.
problem Combining neural networks with symbolic reasoning for scalable inference.
method A-NeSI: a new framework for PNL using neural networks for approximate inference.
result A-NeSI achieves scalable approximate inference without semantic changes.
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.
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.
PPPD framework extracts physical characterizations from stochastic mechanical systems.
problem Complex system behavior requires more than probabilistic descriptions of QoI.
method Probabilistic Performance-Pattern Decomposition (PPPD) framework.
result Decomposes system behaviors into meaningful patterns in response space.
Proposes a probabilistic optimization method for large-scale problems.
problem Large-scale regularized optimization problems.
method Develops a probabilistic interpretation of the incremental proximal gradient algorithm and uses Bayesian filtering.
result Makes it possible to solve large-scale problems using well-known Bayesian filters.
New framework integrates imitation and reinforcement learning for better robot performance.
problem Combining reinforcement and imitation learning for intelligent robotics.
method Extends probabilistic generative model framework for reinforcement learning and develops pMDP-MO for Markov decision processes.
result Significantly better performance than reinforcement or imitation learning alone.