🎯 Randomized Algorithms - DiToast · Scour

Interpreting the Error of Differentially Private Median Queries through Randomization Intervals 🎲Probabilistic Programming

arxiv.org·7h

High-Precision Estimation of the State-Space Complexity of Shogi via the Monte Carlo Method 📈Complexity Theory

arxiv.org·1d

Nested Multilevel Monte Carlo with Preintegration for Efficient Risk Estimation 🎲Probabilistic Programming

arxiv.org·3d

A Multilevel Monte Carlo Virtual Element Method for Uncertainty Quantification of Elliptic Partial Differential Equations 🎲Probabilistic Programming

arxiv.org·7h

Evaluation of Randomization through Style Transfer for Enhanced Domain Generalization 🎲Probabilistic Programming

arxiv.org·2d

Convolutional Surrogate for 3D Discrete Fracture-Matrix Tensor Upscaling 🎲Probabilistic Programming

arxiv.org·4d

Uncertainty Estimation for Deep Reconstruction in Actuatic Disaster Scenarios with Autonomous Vehicles 🎲Probabilistic Programming

arxiv.org·1d

FVD: Inference-Time Alignment of Diffusion Models via Fleming-Viot Resampling 🎲Probabilistic Programming

arxiv.org·1d

DosimeTron: Automating Personalized Monte Carlo Radiation Dosimetry in PET/CT with Agentic AI 🎲Probabilistic Programming

arxiv.org·1d

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes 🎲Probabilistic Programming

arxiv.org·7h

Analysis of Search Heuristics in the Multi-Armed Bandit Setting 📐Algorithms

arxiv.org·7h

Stochastic Function Certification with Correlations 🎲Probabilistic Programming

arxiv.org·4d

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection 📐Algorithms

arxiv.org·7h

Provably Adaptive Linear Approximation for the Shapley Value and Beyond 🎲Probabilistic Programming

arxiv.org·7h

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances 📐Algorithms

arxiv.org·2d

Maximally Random Sortition 📐Algorithms

arxiv.org·3d

Parallel Batch-Dynamic Maximal Independent Set 🎲Probabilistic Programming

arxiv.org·7h

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver 🎯Constraint Programming

arxiv.org·2d

Reconstructing the Geometry of Random Geometric Graphs 🕸️Graph Theory

arxiv.org·7h

The Random Subsequence Model and Uniform Codes for the Deletion Channel 📊Information Theory

arxiv.org·1d

Loading more...