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

20 results for “Probabilistic databases”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.DSTheoreticalRecentSep 18, 2026

The Complexity of Computing Class Probabilities in BID Probabilistic Databases

Sotiris Kanellopoulos, Ioannis Koutras, Aris Pagourtzis

Computes class probabilities in block-independent disjoint probabilistic databases.

View →
cs.DSmath.PRTheoreticalRecentJul 24, 2026

HyperLogLog for probabilists

Lucas Gerin

This paper provides non-asymptotic and explicit estimates for the exponential deviation inequalities of the HyperLogLog estimator.

View →
cs.CLcs.AIRecentMay 28, 2026

EviLink: Multi-Path Schema Linking with Uncertainty-Guided Evidence Acquisition for Large-Scale Text-to-SQL

Huawei Zheng, Sen Yang, Zhaorui Yang, Yuhui Zhang +11 more

EviLink addresses the ambiguity of schema linking in Text-to-SQL by treating it as an uncertainty-aware inference over multiple plausible SQL paths, significantly improving recall and efficiency.

View →
cs.LGcs.AIRecentMay 29, 2026

From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets

Zakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer +1 more

The paper introduces PRAXIS, a novel algorithm that efficiently approximates the computation of 'Rashomon sets' for decision trees, significantly reducing memory and runtime complexity.

View →
cs.DBcs.AIRecentMay 29, 2026

SpecDB: LLM-Generated Customized Databases via Feature-Oriented Decomposition

Yunkai Lou, Longbin Lai, Shunyang Li, Zhengping Qian +1 more

SpecDB is a novel system that uses LLMs to synthesize highly customized, purpose-built relational databases, achieving performance comparable to commercial systems while significantly reducing code si…

View →
cs.IRcs.LGstat.MLRecentJun 3, 2026

Distributional Approximate Nearest Neighbour Search for Uncertainty-Aware Retrieval

Olivier Jeunen

The paper proposes DINOSAUR, a framework that incorporates embedding uncertainty into Approximate Nearest Neighbour search to improve retrieval for niche, long-tail content.

View →
cs.CLEmpiricalRecentOct 24, 2026

Schema-Free Text-to-SQL: Learning Enterprise Database Structure from Query Logs

Ömer Faruk Akgül, Nikhil Kapahi, Prajit Reddy Muppidi

A text-to-SQL framework that learns database structure from historical query logs and operates without schema documentation.

View →
cs.DScs.LGstat.MLTheoreticalRecentJun 9, 2026

Fixed-Parameter Tractability of Private Synthetic Data Generation

Badih Ghazi, Cristóbal Guzmán, Pritish Kamath, Alexander Knop +2 more

The paper studies the problem of generating synthetic data under differential privacy and achieves fixed-parameter tractability.

View →
cs.PLEmpiricalRecentJun 13, 2026

Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams

Kevin Batz, Daniel Basgöze, Sebastian Junges, Joost-Pieter Katoen

The paper develops typed extended decision diagrams (TEDDs) to improve the scalability of deductive probabilistic program verification.

View →
cs.LGcs.PLEmpiricalRecentAug 5, 2026

PPDL: LLM-Based Flows as Probabilistic Programs

Louis Mandel, Guillaume Baudart, Mandana Vaziri, Martin Hirzel

This paper introduces a probabilistic language for programming large language model-based flows to quantify and propagate uncertainty.

View →
cs.SEcs.AIcs.PLEmpiricalRecentOct 27, 2026

ProCerDCL: Query-Efficient Black-Box Probabilistic Verification of Deep Learning Compiler Optimization

Zexin Li, Weibo Zhang, Linyi Li, Arvind Easwaran +1 more

A query-efficient framework for black-box probabilistic verification.

View →