9 citations · 14 across the 8 of their papers we have counts for
10 papers
Randomization Boosts KV Caching, Learning Balances Query Load: A Joint Perspective
Fangzhou Wu, Sandeep Silwal, Qiuyi +1
KV caching is a fundamental technique for accelerating Large Language Model (LLM) inference by reusing key-value (KV) pairs from previous queries, but its effectiveness under limit…
Even Faster Kernel Matrix Linear Algebra via Density Estimation
Rikhav Shah, Sandeep Silwal, Haike Xu
This paper studies the use of kernel density estimation (KDE) for linear algebraic tasks involving the kernel matrix of a collection of data points in . In particu…
A Concentration Inequality for the Facility Location Problem
Sandeep Silwal
We give a concentration inequality for a stochastic version of the facility location problem. We show the objective $C_n = \min_{F \subseteq [0,1]^2}|F|+\sum_{x\in X}\min_{f\in F}\…
Smoothed analysis of the condition number under low-rank perturbations
Rikhav Shah, Sandeep Silwal
Let be an arbitrary by matrix of rank . We study the condition number of plus a \emph{low-rank} perturbation where are by random Gaussian…
A note on the universality of ESDs of inhomogeneous random matrices
Vishesh Jain, Sandeep Silwal
In this short note, we extend the celebrated results of Tao and Vu, and Krishnapur on the universality of empirical spectral distributions to a wide class of inhomogeneous complex…
Using Dimensionality Reduction to Optimize t-SNE
Rikhav Shah, Sandeep Silwal
t-SNE is a popular tool for embedding multi-dimensional datasets into two or three dimensions. However, it has a large computational cost, especially when the input data has many d…
Property Testing of LP-Type Problems
Rogers Epstein, Sandeep Silwal
Given query access to a set of constraints , we wish to quickly check if some objective function subject to these constraints is at most a given value . We approach this…
Infinitely Many Primes Using Generating Functions
Sandeep Silwal
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only use…
Spectral methods for testing cluster structure of graphs
Sandeep Silwal, Jonathan Tidor
In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is -clusterable if it can be part…
Directed Random Geometric Graphs
Jesse Michel, Sushruth Reddy, Rikhav Shah +2
Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet, and the network of followers on Twitter among many other…