English
Related papers

Related papers: On classical advice, sampling advice and complexit…

200 papers

Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…

Quantum Physics · Physics 2015-10-07 Howard Dale , David Jennings , Terry Rudolph

We give a corrected proof that if PP $\subseteq$ BQP/qpoly, then the Counting Hierarchy collapses, as originally claimed by [Aaronson 2006 arXiv:cs/0504048]. This recovers the related unconditional claim that PP does not have circuits of…

Computational Complexity · Computer Science 2025-11-26 Justin Yirka

There is a received wisdom about where to draw the boundary between classical and nonclassical for various types of quantum processes. For multipartite states, it is the divide between separable and entangled; for channels, the divide…

Quantum Physics · Physics 2026-01-28 Yujie Zhang , David Schmid , Yìlè Yīng , Robert W. Spekkens

Nonclassicality, defined in the quantum optical sense, serves as a resource for photon-based quantum technologies. Therefore, certifying the nonclassicality of a quantum state is crucial for gauging its potential for quantum advantage.…

We propose a new approach for metric learning by framing it as learning a sparse combination of locally discriminative metrics that are inexpensive to generate from the training data. This flexible framework allows us to naturally derive…

Machine Learning · Computer Science 2019-01-25 Yuan Shi , Aurélien Bellet , Fei Sha

Meta-learning is a popular framework for learning with limited data in which an algorithm is produced by training over multiple few-shot learning tasks. For classification problems, these tasks are typically constructed by sampling a small…

Machine Learning · Computer Science 2021-10-08 Amrith Setlur , Oscar Li , Virginia Smith

We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the…

Computational Complexity · Computer Science 2009-11-19 Rahul Jain , Hartmut Klauck

Scientific progress is inherently sequential: collective knowledge is updated as new studies enter the literature. We propose the sequential meta-analysis research trace (SMART), which quantifies the influence of each study at the time it…

Methodology · Statistics 2025-11-20 Jonas M. Mikhaeil , Donald P. Green , David Blei

The recently proposed Collaborative Metric Learning (CML) paradigm has aroused wide interest in the area of recommendation systems (RS) owing to its simplicity and effectiveness. Typically, the existing literature of CML depends largely on…

Machine Learning · Computer Science 2022-06-24 Shilong Bao , Qianqian Xu , Zhiyong Yang , Xiaochun Cao , Qingming Huang

Deep learning classifiers are assisting humans in making decisions and hence the user's trust in these models is of paramount importance. Trust is often a function of constant behavior. From an AI model perspective it means given the same…

We consider the relationship between learnability of a "base class" of functions on a set $X$, and learnability of a class of statistical functions derived from the base class. For example, we refine results showing that learnability of a…

Logic in Computer Science · Computer Science 2025-05-28 Aaron Anderson , Michael Benedikt

Learning curves provide insight into the dependence of a learner's generalization performance on the training set size. This important tool can be used for model selection, to predict the effect of more training data, and to reduce the…

Machine Learning · Computer Science 2022-11-08 Tom Viering , Marco Loog

Feedback-based quantum optimization is a quantum approach to combinatorial optimization. In this paper, we introduce the classical counterpart of feedback-based quantum optimization by using the quantum-classical correspondence of spin…

Quantum Physics · Physics 2026-05-14 Tomohiro Hattori , Takuya Hatomura

In management education programmes today, students face a difficult time in choosing electives as the number of electives available are many. As the range and diversity of different elective courses available for selection have increased,…

Information Retrieval · Computer Science 2013-09-27 Sanjog Ray , Anuj Sharma

Real-world datasets are often highly class-imbalanced, which can adversely impact the performance of deep learning models. The majority of research on training neural networks under class imbalance has focused on specialized loss functions,…

Machine Learning · Computer Science 2023-12-06 Ravid Shwartz-Ziv , Micah Goldblum , Yucen Lily Li , C. Bayan Bruss , Andrew Gordon Wilson

In machine learning, classification is usually seen as a function approximation problem, where the goal is to learn a function that maps input features to class labels. In this paper, we propose a novel clustering and classification…

Machine Learning · Computer Science 2025-02-25 Hrushikesh Mhaskar , Ryan O'Dowd , Efstratios Tsoukanis

Natural language data follows a power-law distribution, with most knowledge and skills appearing at very low frequency. While a common intuition suggests that reweighting or curating data towards a uniform distribution may help models…

Artificial Intelligence · Computer Science 2026-04-28 Zixuan Wang , Xingyu Dang , Jason D. Lee , Kaifeng Lyu

In this work we revisit and expand on a 2015 study that used a D-Wave quantum annealer as a sampling engine to assist in the training of a Deep Neural Network. The original 2015 results were reproduced using more recent D-Wave hardware. We…

Quantum Physics · Physics 2020-09-02 Joshua Job , Steve Adachi

Ensembles are a straightforward, remarkably effective method for improving the accuracy,calibration, and robustness of models on classification tasks; yet, the reasons that underlie their success remain an active area of research. We build…

Machine Learning · Statistics 2022-06-22 Neha Gupta , Jamie Smith , Ben Adlam , Zelda Mariet

We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems…

Data Structures and Algorithms · Computer Science 2019-06-24 Kamil Khadiev , Aliya Khadieva , Mansur Ziatdinov , Dmitry Kravchenko , Alexander Rivosh , Ramis Yamilov , Ilnaz Mannapov