Quantum computing for finance

D Herman, C Googin, X Liu, Y Sun, A Galda… - Nature Reviews …, 2023 - nature.com
Quantum computers are expected to surpass the computational capabilities of classical
computers and have a transformative impact on numerous industry sectors. We present a …

Online learning: A comprehensive survey

SCH Hoi, D Sahoo, J Lu, P Zhao - Neurocomputing, 2021 - Elsevier
Online learning represents a family of machine learning methods, where a learner attempts
to tackle some predictive (or any type of decision-making) task by learning from a sequence …

Efficient estimation of Pauli observables by derandomization

HY Huang, R Kueng, J Preskill - Physical review letters, 2021 - APS
We consider the problem of jointly estimating expectation values of many Pauli observables,
a crucial subroutine in variational quantum algorithms. Starting with randomized …

Early detection of Alzheimer's disease using magnetic resonance imaging: a novel approach combining convolutional neural networks and ensemble learning

D Pan, A Zeng, L Jia, Y Huang, T Frizzell… - Frontiers in …, 2020 - frontiersin.org
Early detection is critical for effective management of Alzheimer's disease (AD) and
screening for mild cognitive impairment (MCI) is common practice. Among several deep …

Introduction to multi-armed bandits

A Slivkins - Foundations and Trends® in Machine Learning, 2019 - nowpublishers.com
Multi-armed bandits a simple but very powerful framework for algorithms that make
decisions over time under uncertainty. An enormous body of work has accumulated over the …

A survey on the densest subgraph problem and its variants

T Lanciano, A Miyauchi, A Fazzone, F Bonchi - ACM Computing Surveys, 2024 - dl.acm.org
The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

The algorithmic foundations of differential privacy

C Dwork, A Roth - Foundations and Trends® in Theoretical …, 2014 - nowpublishers.com
The problem of privacy-preserving data analysis has a long history spanning multiple
disciplines. As electronic data about individuals becomes increasingly detailed, and as …

Introduction to online convex optimization

E Hazan - Foundations and Trends® in Optimization, 2016 - nowpublishers.com
This monograph portrays optimization as a process. In many practical applications the
environment is so complex that it is infeasible to lay out a comprehensive theoretical model …

Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile

P Mertikopoulos, B Lecouat, H Zenati, CS Foo… - arxiv preprint arxiv …, 2018 - arxiv.org
Owing to their connection with generative adversarial networks (GANs), saddle-point
problems have recently attracted considerable interest in machine learning and beyond. By …

A marketplace for data: An algorithmic solution

A Agarwal, M Dahleh, T Sarkar - … of the 2019 ACM Conference on …, 2019 - dl.acm.org
In this work, we aim to design a data marketplace; a robust real-time matching mechanism to
efficiently buy and sell training data for Machine Learning tasks. While the monetization of …