Cover Image

Credal Bayesian Deep Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Caprio, Michele, Dutta, Souradeep, Jang, Kuk Jin, Lin, Vivian, Ivanov, Radoslav, Sokolsky, Oleg, Lee, Insup
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Primary: 68T37, Secondary: 68T05, 68W25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Credal and Interval Deep Evidential Classifications
by: Caprio, Michele, et al.
Published: (2025)

When Do Credal Sets Stabilize? Fixed-Point Theorems for Credal Set Updates
by: Caprio, Michele, et al.
Published: (2025)

Reciprocal Learning
by: Rodemann, Julian, et al.
Published: (2024)

Approximating k-Center via Farthest-First on $δ$-Covers
by: Wilson, Jason R.
Published: (2026)

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)

A Comparative Study of Recommender Systems under Big Data Constraints
by: Scrivano, Arimondo
Published: (2025)

Tight complexity bounds for diagram commutativity verification
by: Malko, Artem, et al.
Published: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Evolutionary Computation as Natural Generative AI
by: Shi, Yaxin, et al.
Published: (2025)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
by: Bauschke, Heinz H., et al.
Published: (2025)

An Analysis of Optimizer Choice on Energy Efficiency and Performance in Neural Network Training
by: Almog, Tom
Published: (2025)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
by: Coşa, Matei Gabriel, et al.
Published: (2025)

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

Hodge Laplacians and Hodge Diffusion Maps
by: Gomez, Alvaro Almeida, et al.
Published: (2025)

In-Context Learning with Topological Information for Knowledge Graph Completion
by: Sehwag, Udari Madhushani, et al.
Published: (2024)

Reinforcement Learning with Action-Triggered Observations
by: Ryabchenko, Alexander, et al.
Published: (2025)

L-System Genetic Encoding for Scalable Neural Network Evolution: A Comparison with Direct Matrix Encoding
by: Stuy, Alexander, et al.
Published: (2026)

Massively Parallel Reductions in Multivariate Polynomial Systems: Bridging the Symbolic Preprocessing Gap on GPGPU Architectures
by: Gokavarapu, Chandrasekhar
Published: (2026)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies
by: Gerlach, Raphael, et al.
Published: (2023)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
by: Roucairol, Milo, et al.
Published: (2024)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

Generating DDPM-based Samples from Tilted Distributions
by: Mandal, Himadri, et al.
Published: (2026)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
by: Gupta, Swati, et al.
Published: (2026)

Real-time chaotic video encryption based on multithreaded parallel confusion and diffusion
by: Jiang, Dong, et al.
Published: (2023)

Algorithms for Parallel Shared-Memory Sparse Matrix-Vector Multiplication on Unstructured Matrices
by: Bergmans, Kobe, et al.
Published: (2025)

Massively Parallel Modular Methods in Commutative Algebra and Algebraic Geometry
by: Basson, Dirk, et al.
Published: (2024)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)