2 citations · 2 across the 4 of their papers we have counts for
6 papers
A simplified proof of polynomial improvements for 3SUM and APSP
Sankeerth Rao Karingula, Shachar Lovett
We give a simplified proof of the polynomial improvements for integer 3SUM and all-pairs shortest paths (APSP) established by Alman and Vassilevska Williams, with weaker exponents.…
Limitations of the slice rank method in additive combinatorics
Sankeerth Rao Karingula, Shachar Lovett
The slice rank method gives exponential bounds for sets with no three-term arithmetic progression in finite vector spaces of odd characteristic and for three-sunflower-free familie…
An elementary proof of the Komlós conjecture
Sankeerth Rao Karingula, Shachar Lovett
We give an elementary proof of the Komlós conjecture by simplifying the recent proof of Guo, Fang, and Lu. We show that any vectors with $\|v_i\|_2\…
Time Series Anomaly Detection with label-free Model Selection
Deokwoo Jung, Nandini Ramanan, Mehrnaz Amjadi +3
Anomaly detection for time-series data becomes an essential task for many data-driven applications fueled with an abundance of data and out-of-the-box machine-learning algorithms.…
Boosted Embeddings for Time Series Forecasting
Sankeerth Rao Karingula, Nandini Ramanan, Rasool Tahmasbi +7
Time series forecasting is a fundamental task emerging from diverse data-driven applications. Many advanced autoregressive methods such as ARIMA were used to develop forecasting mo…
Singularity of random integer matrices with large entries
Sankeerth Rao Karingula, Shachar Lovett
We study the singularity probability of random integer matrices. Concretely, the probability that a random matrix, with integer entries chosen uniformly from $\{-m,\ld…