default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGoutham Rajendran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Goutham Rajendran, Patrik Reizinger, Wieland Brendel, Pradeep Kumar Ravikumar:
An Interventional Perspective on Identifiability in Gaussian LTI Systems with Independent Component Analysis. CLeaR 2024: 41-70- [c10]Yibo Jiang, Goutham Rajendran, Pradeep Kumar Ravikumar, Bryon Aragam, Victor Veitch:
On the Origins of Linear Representations in Large Language Models. ICML 2024 - [i17]Goutham Rajendran, Simon Buchholz, Bryon Aragam, Bernhard Schölkopf, Pradeep Ravikumar:
Learning Interpretable Concepts: Unifying Causal Representation Learning and Foundation Models. CoRR abs/2402.09236 (2024) - [i16]Yibo Jiang, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam, Victor Veitch:
On the Origins of Linear Representations in Large Language Models. CoRR abs/2403.03867 (2024) - [i15]Ainesh Bakshi, Pravesh Kothari, Goutham Rajendran, Madhur Tulsiani, Aravindan Vijayaraghavan:
Efficient Certificates of Anti-Concentration Beyond Gaussians. CoRR abs/2405.15084 (2024) - [i14]Yibo Jiang, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Do LLMs dream of elephants (when told not to)? Latent concept association and associative memory in transformers. CoRR abs/2406.18400 (2024) - 2023
- [c9]Simon Buchholz, Goutham Rajendran, Elan Rosenfeld, Bryon Aragam, Bernhard Schölkopf, Pradeep Ravikumar:
Learning Linear Causal Representations from Interventions under General Nonlinear Mixing. NeurIPS 2023 - [c8]Goutham Rajendran, Madhur Tulsiani:
Concentration of polynomial random matrices via Efron-Stein inequalities. SODA 2023: 3614-3653 - [c7]Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu:
Sum-of-Squares Lower Bounds for Densest k-Subgraph. STOC 2023: 84-95 - [i13]Goutham Rajendran:
Nonlinear Random Matrices and Applications to the Sum of Squares Hierarchy. CoRR abs/2302.04462 (2023) - [i12]Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu:
Sum-of-Squares Lower Bounds for Densest k-Subgraph. CoRR abs/2303.17506 (2023) - [i11]Simon Buchholz, Goutham Rajendran, Elan Rosenfeld, Bryon Aragam, Bernhard Schölkopf, Pradeep Ravikumar:
Learning Linear Causal Representations from Interventions under General Nonlinear Mixing. CoRR abs/2306.02235 (2023) - [i10]Goutham Rajendran, Patrik Reizinger, Wieland Brendel, Pradeep Ravikumar:
An Interventional Perspective on Identifiability in Gaussian LTI Systems with Independent Component Analysis. CoRR abs/2311.18048 (2023) - 2022
- [c6]Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Identifiability of deep generative models without auxiliary information. NeurIPS 2022 - [c5]Aaron Potechin, Goutham Rajendran:
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis. NeurIPS 2022 - [i9]Bohdan Kivva
, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Identifiability of deep generative models under mixture priors without auxiliary information. CoRR abs/2206.10044 (2022) - [i8]Goutham Rajendran:
Combinatorial Optimization via the Sum of Squares Hierarchy. CoRR abs/2208.04374 (2022) - [i7]Goutham Rajendran, Wei Zou:
Analyzing Robustness of End-to-End Neural Models for Automatic Speech Recognition. CoRR abs/2208.08509 (2022) - [i6]Goutham Rajendran, Madhur Tulsiani:
Concentration of polynomial random matrices via Efron-Stein inequalities. CoRR abs/2209.02655 (2022) - 2021
- [c4]Chris Jones, Aaron Potechin, Goutham Rajendran, Madhur Tulsiani, Jeff Xu:
Sum-of-Squares Lower Bounds for Sparse Independent Set. FOCS 2021: 406-416 - [c3]Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Learning latent causal graphs via mixture oracles. NeurIPS 2021: 18087-18101 - [c2]Goutham Rajendran, Bohdan Kivva, Ming Gao, Bryon Aragam:
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families. NeurIPS 2021: 18660-18672 - [i5]Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Learning latent causal graphs via mixture oracles. CoRR abs/2106.15563 (2021) - [i4]Goutham Rajendran, Bohdan Kivva, Ming Gao, Bryon Aragam:
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families. CoRR abs/2110.04719 (2021) - [i3]Chris Jones, Aaron Potechin, Goutham Rajendran, Madhur Tulsiani, Jeff Xu:
Sum-of-Squares Lower Bounds for Sparse Independent Set. CoRR abs/2111.09250 (2021) - 2020
- [c1]Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran:
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. FOCS 2020: 954-965 - [i2]Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran:
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. CoRR abs/2009.01874 (2020) - [i1]Aaron Potechin, Goutham Rajendran:
Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems. CoRR abs/2011.04253 (2020)
Coauthor Index
aka: Pradeep Kumar Ravikumar
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-09-04 01:24 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:
