default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGanesh R. Kini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Ganesh Ramachandra Kini, Vala Vakilian, Tina Behnia, Jaidev Gill, Christos Thrampoulidis:
Symmetric Neural-Collapse Representations with Supervised Contrastive Loss: The Impact of ReLU and Batching. ICLR 2024- 2023
- [c7]Tina Behnia, Ganesh Ramachandra Kini, Vala Vakilian, Christos Thrampoulidis:
On the Implicit Geometry of Cross-Entropy Parameterizations for Label-Imbalanced Data. AISTATS 2023: 10815-10838 - [i8]Tina Behnia, Ganesh Ramachandra Kini, Vala Vakilian, Christos Thrampoulidis:
On the Implicit Geometry of Cross-Entropy Parameterizations for Label-Imbalanced Data. CoRR abs/2303.07608 (2023) - [i7]Ganesh Ramachandra Kini, Vala Vakilian, Tina Behnia, Jaidev Gill, Christos Thrampoulidis:
Supervised-Contrastive Loss Learns Orthogonal Frames and Batching Matters. CoRR abs/2306.07960 (2023) - 2022
- [c6]Christos Thrampoulidis, Ganesh Ramachandra Kini, Vala Vakilian, Tina Behnia:
Imbalance Trouble: Revisiting Neural-Collapse Geometry. NeurIPS 2022 - [i6]Christos Thrampoulidis, Ganesh R. Kini, Vala Vakilian, Tina Behnia:
Imbalance Trouble: Revisiting Neural-Collapse Geometry. CoRR abs/2208.05512 (2022) - 2021
- [c5]Ganesh Ramachandra Kini, Christos Thrampoulidis:
Phase Transitions for One-Vs-One and One-Vs-All Linear Separability in Multiclass Gaussian Mixtures. ICASSP 2021: 4020-4024 - [c4]Ganesh Ramachandra Kini, Orestis Paraskevas, Samet Oymak, Christos Thrampoulidis:
Label-Imbalanced and Group-Sensitive Classification under Overparameterization. NeurIPS 2021: 18970-18983 - [i5]Ganesh Ramachandra Kini, Orestis Paraskevas, Samet Oymak, Christos Thrampoulidis:
Label-Imbalanced and Group-Sensitive Classification under Overparameterization. CoRR abs/2103.01550 (2021) - 2020
- [j1]Balaji Srinivasan Babu, Ganesh R. Kini
, P. Vijay Kumar:
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures. IEEE Trans. Inf. Theory 66(2): 1023-1052 (2020) - [c3]Ganesh Ramachandra Kini, Christos Thrampoulidis:
Analytic Study of Double Descent in Binary Classification: The Impact of Loss. ISIT 2020: 2527-2532 - [i4]Ganesh R. Kini, Christos Thrampoulidis:
Analytic Study of Double Descent in Binary Classification: The Impact of Loss. CoRR abs/2001.11572 (2020)
2010 – 2019
- 2018
- [c2]Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh R. Kini, Elita A. Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexander Barg, Min Ye, Srinivasan Narayanamurthy, Syed Hussain, Siddhartha Nandi:
Clay Codes: Moulding MDS Codes to Yield an MSR Code. FAST 2018: 139-154 - [i3]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Rate-Optimal Construction of Codes with Sequential Recovery with Low Block Length. CoRR abs/1801.06794 (2018) - [i2]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures. CoRR abs/1812.02502 (2018) - 2017
- [c1]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures. ISIT 2017: 1778-1782 - 2016
- [i1]Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Bound on Rate of Codes with Locality with Sequential Recovery from Multiple Erasures. CoRR abs/1611.08561 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-08 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
