66 citations · 145 across the 19 of their papers we have counts for
9 papers · 1 filter
A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
Tyler Chen, Junhyung Lyle Kim, Archan Ray +3
We describe and analyze a simple algorithm for sampling from the solution to a linear system . We assume…
GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches
Tyler Chen, Pradeep Niroula, Archan Ray +3
A litany of theoretical and numerical results have established the sketch-and-precondition paradigm as a powerful approach to solving large linear regression problems in standard c…
MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuning
Javier Lopez-Piqueres, Pranav Deshpande, Archan Ray +3
We present MetaTT, a Tensor Train (TT) adapter framework for fine-tuning of pre-trained transformers. MetaTT enables flexible and parameter-efficient model adaptation by using a si…
A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values
Tyler Chen, Akshay Seshadri, Mattia J. Villani +7
Shapley values have emerged as a critical tool for explaining which features impact the decisions made by machine learning models. However, computing exact Shapley values is diffic…
A Numerical Gradient Inversion Attack in Variational Quantum Neural-Networks
Georgios Papadopoulos, Shaltiel Eloul, Yash Satsangi +4
The loss landscape of Variational Quantum Neural Networks (VQNNs) is characterized by local minima that grow exponentially with increasing qubits. Because of this, it is more chall…
Provably faster randomized and quantum algorithms for -means clustering via uniform sampling
Tyler Chen, Archan Ray, Akshay Seshadri +6
The -means algorithm (Lloyd's algorithm) is a widely used method for clustering unlabeled data. A key bottleneck of the -means algorithm is that each iteration requires time…
New Improvements in Solving Large LABS Instances Using Massively Parallelizable Memetic Tabu Search
Zhiwei Zhang, Jiayu Shen, Niraj Kumar +1
Low Autocorrelation Binary Sequences (LABS) is a particularly challenging binary optimization problem which quickly becomes intractable in finding the global optimum for problem si…
Certified randomness using a trapped-ion quantum processor
Minzhao Liu, Ruslan Shaydulin, Pradeep Niroula +29
While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a…
Applications of Certified Randomness
Omar Amer, Shouvanik Chakrabarti, Kaushik Chakraborty +8
Certified randomness can be generated with untrusted remote quantum computers using multiple known protocols, one of which has been recently realized experimentally. Unlike the ran…