Code for paper "Efficient Sparse Coding using Hierarchical Riemannian Pursuit," in IEEE Transactions on Signal Processing, Y. Xue, V. K. N. Lau and S. Cai, doi: 10.1109/TSP.2021.3093769.
-
Updated
Jul 20, 2021 - MATLAB
Code for paper "Efficient Sparse Coding using Hierarchical Riemannian Pursuit," in IEEE Transactions on Signal Processing, Y. Xue, V. K. N. Lau and S. Cai, doi: 10.1109/TSP.2021.3093769.
We analyze algorithms to learn Gaussian Bayesian networks with known structure up to a bounded error in total variation distance.
OSRL (Optimal Representation Learning in Multi-Task Bandits) comprises an algorithm that addresses the problem of sample complexity with fixed confidence in Multi-Task Bandit problems. Published at the Thirty-Seventh AAAI Conference on Artificial Intelligence (AAAI23)
Paper and verification code: a single-copy lower bound for rank-one nonlinear overlap estimation
Python implementation of algorithms for Best Policy Identification in Markov Decision Processes
Recover hidden quantum source pairings from separable snapshots with optimal shot bounds.
Copy and memory limits for quantum reference identification, with finite-query error bounds and sharp saturation of classical preprocessing before an unknown query arrives.
Copy complexity limits for quantum exponential updating with known spectra and unknown state orientations.
Copy complexity of reproducing labeled quantum trajectories, with unknown measurement probabilities and coherent processing.
Exact retained-qubit frontier for quantum complement sampling, with optimal decoders, converse bounds, source constructions, and dephasing analysis.
Reproduction code for the paper 'Structure, Not Size: The Sample and Parameter Complexity of State Tracking in Selective State-Space Models' (selective PD-SSM / diagonal SSM / GRU state-tracking, MLX).
This package was the result of master thesis that is seen at link https://tede2.uepg.br/jspui/handle/prefix/152 and in the article https://doi.org/10.5335/rbca.2015.3727.
Exact flat-rank quantum classification and rank-dependent limits on coherent learning and classical compilation.
Copy-optimal estimation of quantum loop phases and a sharp four-state copy versus coherent-run tradeoff.
Sharp robustness criteria and optimal certification costs for quantum operations from finite pure-state training sets.
Known-state quantum certification under noisy local readout: adaptive sample-complexity bounds, a sharp binary exponent, and fidelity noise thresholds.
Root-fidelity estimation under complete quantum resets, with adaptive converses and a loop-phase application.
Finite-sample guarantees and reproducible experiments for MARVEL/L-MARVEL and PC-style causal discovery
Sharp copy-complexity bounds for noisy quantum purity testing, revealing an exponential advantage of collective measurements over adaptive two-copy strategies.
Optimal outcome counts, polynomial rigidity, and statistical costs of universal entanglement detection using fixed collective quantum measurements.
To associate your repository with the sample-complexity topic, visit your repo's landing page and select "manage topics."