QKLA achieves quadratic query-complexity improvement for clipped KL estimation, yielding 2.7-7.4x fewer oracle queries than classical methods when embedded in the PC causal-discovery algorithm at moderate precision.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Collision fiber sizes determine precise zero-error compression bounds and rate-distortion laws for semantic identity, establishing symbolic mechanisms as necessary complements to non-injective neural representations.
Three frameworks adapt foundation models for generalized category discovery under domain shifts via disentanglement and prompt tuning, showing gains on synthetic and real multi-domain data.
The work derives an approximate local secrecy capacity and defines secret local contraction coefficients as largest generalized eigenvalues of channel matrix pencils, obtained via local Euclidean geometry approximations to the wiretap channel optimization problem.
citing papers explorer
-
Quantum Causal Discovery via Amplitude Estimation of Kullback-Leibler Divergence
QKLA achieves quadratic query-complexity improvement for clipped KL estimation, yielding 2.7-7.4x fewer oracle queries than classical methods when embedded in the PC causal-discovery algorithm at moderate precision.
-
Semantic Identity Compression: Zero-Error Laws, Rate-Distortion, and Neurosymbolic Necessity
Collision fiber sizes determine precise zero-error compression bounds and rate-distortion laws for semantic identity, establishing symbolic mechanisms as necessary complements to non-injective neural representations.
-
Generalized Category Discovery under Domain Shifts: From Vision to Vision-Language Models
Three frameworks adapt foundation models for generalized category discovery under domain shifts via disentanglement and prompt tuning, showing gains on synthetic and real multi-domain data.
-
Local Information-Theoretic Security via Euclidean Geometry
The work derives an approximate local secrecy capacity and defines secret local contraction coefficients as largest generalized eigenvalues of channel matrix pencils, obtained via local Euclidean geometry approximations to the wiretap channel optimization problem.