ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “probability theory”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGmath.OCmath.PREmpiricalRecentJun 9, 2026

Data-Driven Dynamic Assortment in Online Platforms: Learning about Two Sides

Rahul Roy, Nur Sunar, Jayashankar M. Swaminathan

This paper studies a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers, and develops a data-driven algorithm to learn parameters and op…

View →
cs.AIcs.LGecon.THRecentMay 31, 2026

Prospect-Theory Behavior from Bellman Optimality in MDPs with Catastrophic States

Yujiao Chen

This paper shows that standard optimal control in Markov Decision Processes (MDPs) with an absorbing catastrophic state naturally generates behavioral signatures mimicking prospect theory, even withou…

View →
cs.CReess.SYmath.PRRecentMay 30, 2026

Stochastic Analysis of Cybersecurity Defense Strategies Under Single Attack Scenario

Song-Kyoo Kim

The paper develops a stochastic framework using Laplace-Carson transforms to model and quantify optimal proactive defense timing against a single cyberattack, providing closed-form solutions for defen…

View →
cs.DMcs.ITTheoreticalRecentJun 11, 2026

Entropic Generation of Binary Words

Olivier Bodini, Francis Durand

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

View →
cs.DMcs.CGTheoreticalRecentJun 11, 2026

On the Counting Sequence of Z-convex Polyominoes

Luca Castelli, Paolo Massazza

This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.

View →
cs.CRcs.PLRecentMay 28, 2026

A Bayesian Approach to Membership Inference for Statistical Release

Lisa Oakley, Sam Stites, Cameron Moy, Steven Holtzen +2 more

This paper proposes a Bayesian framework to enhance membership inference attacks against released statistics by incorporating prior knowledge about the population's attribute dependency structure, out…

View →
cs.DScs.CRRecentMay 20, 2026

Near-Optimal Generalized Private Testing

Anamay Chaturvedi, Monika Henzinger, Jalaj Upadhyay

The paper introduces the Generalized Thresholding Mechanism (GTM) to solve the generalized private testing problem in differential privacy, achieving near-optimal accuracy and sample complexity guaran…

View →
cs.AIRecentMay 29, 2026

Formalizing and falsifying causal pathways of rare events

Anahita Haghighat, Dominik Janzing

The paper formalizes the concept of a causal pathway for rare events, showing that testable implications can be derived solely from this pathway abstraction, simplifying complex causal modeling.

View →
cs.NEmath.APmath.PRRecentJun 4, 2026

Quantifying Uncertainty In Wide Two-Layer Neural Networks: On The Law Of The Limiting Fluctuation Process

Arnaud Descours, Arnaud Guillin, Geoffrey Lacour, Manon Michel +2 more

This paper develops a novel, computationally efficient method to quantify the uncertainty in wide neural network predictions by characterizing the limiting random fluctuations using stochastic evoluti…

View →
cs.DScs.CCTheoreticalRecentJun 11, 2026

Sketching Intersection Profiles: A Simple Proof and Three Applications

Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi +2 more

This paper settles the complexity of three sketching problems in graphs and distributions.

View →
cs.CRRecentApr 10, 2026

Hagenberg Risk Management Process (Part 3): Operationalization, Probabilities, and Causal Analysis

Eckehard Hermann, Harald Lampesberger

The paper introduces a comprehensive framework, Realtime Risk Studio, that operationalizes qualitative risk models (Bowtie diagrams) into formal, probabilistic, and intervention-ready runtime models u…

View →
cs.LGcs.AIcs.CLRecentMay 28, 2026

Reasoning with Sampling: Cutting at Decision Points

Felix Zhou, Anay Mehrotra, Quanquan C. Liu

The paper introduces Entropy-Cut Metropolis-Hastings, an efficient sampling method that uses next-token entropy to identify and resample from critical decision points in a reasoning trace, significant…

View →
cs.CRRecentApr 1, 2026

Preserving Target Distributions With Differentially Private Count Mechanisms

Nitin Kohli, Paul Laskowski

The paper proposes a novel two-stage framework to differentially privatize tables of counts by focusing on preserving the accuracy of the underlying count distribution, introducing the specialized cyc…

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Improved Distribution Estimation in $\ell_\infty$

Doron Cohen, Aryeh Kontorovich, Yonatan Livshitz

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

View →
stat.MLcs.LGmath.STRecentJun 3, 2026

Bayesian learning for the stochastic shortest path problem

Chon Wai Ho, Sumeetpal S. Singh, Jiaqi Guo

The paper proposes a novel Bayesian framework to learn the optimal decision strategy for the stochastic shortest path problem by directly constructing the posterior beliefs for the action-value functi…

View →
math.OCcs.AIcs.LGRecentJun 1, 2026

MINTS: Minimalist Thompson Sampling

Kaizheng Wang

The paper introduces MINTS, a minimalist Bayesian framework that simplifies sequential decision-making by placing priors only on the optimum location, allowing for the incorporation of structural cons…

View →
cs.LGcs.CYRecentJun 1, 2026

Model Multiplicity and Predictive Arbitrariness in Recidivism Risk Assessment

Ashwin Singh, Carlos Castillo

The paper investigates predictive multiplicity and arbitrariness in recidivism risk assessment, finding that similarly accurate models often exhibit high predictive agreement, and proposes a simple po…

View →
cs.LGcs.AIRecentMay 28, 2026

The Little Book of Generative AI Foundations: An Intuitive Mathematical Primer

Tianhua Chen

This book provides a compact, derivation-oriented mathematical primer that connects major families of generative AI models, showing their underlying structural relationships.

View →
cs.CRRecentMar 20, 2026

Constraint Migration: A Formal Theory of Throughput in AI Cybersecurity Pipelines

Surasak Phetmanee

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

View →
cs.CCRecentMay 31, 2026

On the Complexity of Recurrence Evaluation

Artem Parfenov, Michael Vyalyi

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

View →