This paper links test martingales with Bayes factors and p-values, introducing functions to limit evidence exaggeration, enabling systematic conversion between them.

Glenn Shafer, Alexander Shen, Nikolai Vereshchagin et al.

Proposes a universal framework using local explanation vectors to analyze classification decisions for any classifier.

David Baehrens, Timon Schroeter, Stefan Harmeling et al.

Randomized algorithms for low-rank matrix approximation enable fast, robust processing of massive data sets, outperforming classical methods in speed and scalability.

Nathan Halko, Per-Gunnar Martinsson, Joel A. Tropp

Using CoRoT data, identified 358 candidate B pulsators, revealing a new class of low-amplitude B-type pulsators.

P. Degroote, C. Aerts, M. Ollivier et al.

Proposed quantum algorithm prepares thermal Gibbs state with time upper bound D^α, α linked to free energy density.

David Poulin, Pawel Wocjan

Proposed a fast QMA amplification method using quantum reflection and walk, doubling speed over Marriott and Watrous' method.

Daniel Nagaj, Pawel Wocjan, Yong Zhang

Robust matrix completion via nuclear norm minimization, achieves accurate recovery from nr log^2 n noisy samples with error proportional to noise level.

Emmanuel J. Candes, Yaniv Plan

Proposes nonparanormal model using smooth transformations for high-dimensional sparse graph estimation, outperforming Gaussian models on non-Gaussian data.

Han Liu, John Lafferty, Larry Wasserman

The study uses stellar evolution code to simulate stellar collisions in young clusters, finding no intermediate-mass black holes.

E. Glebbeek, E. Gaburov, S. E. de Mink et al.

Proposes a spectral matrix completion algorithm achieving O(rn) sample efficiency with provable error bounds.

Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh

Linearly Parameterized Bandits use exploration-exploitation strategy to achieve Θ(r√T) cumulative regret and Bayes risk.

Paat Rusmevichientong, John N. Tsitsiklis

Introduces block coherence and guarantees exact recovery of block-sparse signals via BOMP and ℓ2/ℓ1 optimization under specific conditions.

Yonina C. Eldar, Helmut Bolcskei

Quantum algorithm for linear systems achieves poly(log N, κ) time complexity, outperforming classical methods.

Aram W. Harrow, Avinatan Hassidim, Seth Lloyd

Proposes a multi-split aggregation method to improve stability and accuracy of p-values in high-dimensional regression.

Nicolai Meinshausen, Lukas Meier, Peter Bühlmann

Continuous attractor network model achieves high-precision path integration with errors under 15cm over 260m and 20min.

Yoram Burak, Ila R. Fiete

Proves most quantum states are too entangled to serve as universal resources, using geometric entanglement measures and measure concentration.

D. Gross, S. Flammia, J. Eisert

Proposes an algorithm for approximating arbitrary powers of a black box unitary operation, with complexity related to call count, error, and gap parameter.

L. Sheridan, D. Maslov, M. Mosca

Introduces the ‘Zooming algorithm’ for Lipschitz MAB in metric spaces, achieving near-optimal regret bounds based on space complexity measures.

Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal

Derives dimension-independent exponential bounds for vector-valued martingales in 2-smooth normed spaces.

Anatoli Juditsky, Arkadii S. Nemirovski

Quantum walk search algorithms enhance search efficiency by quantizing classical Markov chains.

Miklos Santha