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 …

H2o: Heavy-hitter oracle for efficient generative inference of large language models

Z Zhang, Y Sheng, T Zhou, T Chen… - Advances in …, 2023 - proceedings.neurips.cc
Abstract Large Language Models (LLMs), despite their recent impressive accomplishments,
are notably cost-prohibitive to deploy, particularly for applications involving long-content …

Maximum flow and minimum-cost flow in almost-linear time

L Chen, R Kyng, YP Liu, R Peng… - 2022 IEEE 63rd …, 2022 - ieeexplore.ieee.org
We give an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …

Evaluating gradient inversion attacks and defenses in federated learning

Y Huang, S Gupta, Z Song, K Li… - Advances in neural …, 2021 - proceedings.neurips.cc
Gradient inversion attack (or input recovery from gradient) is an emerging threat to the
security and privacy preservation of Federated learning, whereby malicious eavesdroppers …

Instahide: Instance-hiding schemes for private distributed learning

Y Huang, Z Song, K Li, S Arora - International conference on …, 2020 - proceedings.mlr.press
How can multiple distributed entities train a shared deep net on their private data while
protecting data privacy? This paper introduces InstaHide, a simple encryption of training …

Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances

J Van Den Brand, YT Lee, YP Liu, T Saranurak… - Proceedings of the 53rd …, 2021 - dl.acm.org
In this paper we provide new randomized algorithms with improved runtimes for solving
linear programs with two-sided constraints. In the special case of the minimum cost flow …

Multi-task learning with user preferences: Gradient descent with controlled ascent in pareto optimization

D Mahapatra, V Rajan - International Conference on …, 2020 - proceedings.mlr.press
Abstract Multi-Task Learning (MTL) is a well established paradigm for jointly learning
models for multiple correlated tasks. Often the tasks conflict, requiring trade-offs between …

An online and unified algorithm for projection matrix vector multiplication with application to empirical risk minimization

L Qin, Z Song, L Zhang, D Zhuo - … Conference on Artificial …, 2023 - proceedings.mlr.press
Online matrix vector multiplication is a fundamental step and bottleneck in many machine
learning algorithms. It is defined as follows: given a matrix at the pre-processing phase, at …

Attention scheme inspired softmax regression

Y Deng, Z Li, Z Song - arxiv preprint arxiv:2304.10411, 2023 - arxiv.org
Large language models (LLMs) have made transformed changes for human society. One of
the key computation in LLMs is the softmax unit. This operation is important in LLMs …

A faster interior point method for semidefinite programming

H Jiang, T Kathuria, YT Lee… - 2020 IEEE 61st …, 2020 - ieeexplore.ieee.org
Semidefinite programs (SDPs) are a fundamental class of optimization problems with
important recent applications in approximation algorithms, quantum complexity, robust …