Quantum computing for finance
Quantum computers are expected to surpass the computational capabilities of classical
computers and have a transformative impact on numerous industry sectors. We present a …
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
Abstract Large Language Models (LLMs), despite their recent impressive accomplishments,
are notably cost-prohibitive to deploy, particularly for applications involving long-content …
are notably cost-prohibitive to deploy, particularly for applications involving long-content …
Maximum flow and minimum-cost flow in almost-linear time
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 …
directed graphs with m edges and polynomially bounded integral demands, costs, and …
Evaluating gradient inversion attacks and defenses in federated learning
Gradient inversion attack (or input recovery from gradient) is an emerging threat to the
security and privacy preservation of Federated learning, whereby malicious eavesdroppers …
security and privacy preservation of Federated learning, whereby malicious eavesdroppers …
Instahide: Instance-hiding schemes for private distributed learning
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 …
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
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 …
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
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 …
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
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 …
learning algorithms. It is defined as follows: given a matrix at the pre-processing phase, at …
Attention scheme inspired softmax regression
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 …
the key computation in LLMs is the softmax unit. This operation is important in LLMs …
A faster interior point method for semidefinite programming
Semidefinite programs (SDPs) are a fundamental class of optimization problems with
important recent applications in approximation algorithms, quantum complexity, robust …
important recent applications in approximation algorithms, quantum complexity, robust …