Pranay Tankala

Pranay Tankala

Auto-generated profile, based on publicly available information

Pranay Tankala

Harvard University, Cambridge, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 October 2023 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
ATAbiy Tasissa
Abiy Tasissa
PTPranay Tankala
Pranay Tankala
James MurphyJames Murphy
James Murphy
DBDemba Ba
Demba Ba
We propose K- Deep Simplex (KDS) which, given a set of data points, learns a dictionary comprising synthetic landmarks, along with representation coefficients supported on a simplex. KDS employs a local weighted ℓ 1 penalty that encourages each data point to represent itself as a convex combination of nearby landmarks. We solve the proposed optimization program using alternating minimization and design an efficient, interpretable autoencoder using algorithm unrolling. We theoretically analyse the proposed program by relating the weighted ℓ 1 penalty in KDS to a weighted ℓ 0 program. Assuming that the data are generated from a Delaunay triangulation, we prove the equivalence of the weighted ℓ 1 and weighted ℓ 0 programs. We further show the stability of the representation coefficients under mild geometrical assumptions. If the representation coefficients are fixed, we prove that the sub-problem of minimizing over the dictionary yields a unique solution. Further, we show that low-dimensional representations can be efficiently obtained from the covariance of the coefficient matrix. Experiments show that the algorithm is highly efficient and performs competitively on synthetic and real data sets.


9 June 2026
Verified
Conference Paper
Open access
PGParikshit Gopalan
Parikshit Gopalan
KSKonstantinos Stavropoulos
Konstantinos Stavropoulos
KTKunal Talwar
Kunal Talwar
PTPranay Tankala
Pranay Tankala