default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHemant Tyagi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ernesto Araya Valdivia, Guillaume Braun, Hemant Tyagi:
Seeded Graph Matching for the Correlated Gaussian Wigner Model via the Projected Power Method. J. Mach. Learn. Res. 25: 5:1-5:43 (2024)- [i16]Hemant Tyagi:
Joint Learning of Linear Dynamical Systems under Smoothness Constraints. CoRR abs/2406.01094 (2024) - [i15]Ernesto Araya Valdivia, Mihai Cucuringu, Hemant Tyagi:
Dynamic angular synchronization under smoothness constraints. CoRR abs/2406.04071 (2024) - 2023
- [j5]Eglantine Karlé, Hemant Tyagi:
Dynamic Ranking with the BTL Model: A Nearest Neighbor based Rank Centrality Method. J. Mach. Learn. Res. 24: 269:1-269:57 (2023) - [i14]Hemant Tyagi, Denis V. Efimov:
Learning linear dynamical systems under convex constraints. CoRR abs/2303.15121 (2023) - [i13]Ernesto Araya Valdivia, Hemant Tyagi:
Graph Matching via convex relaxation to the simplex. CoRR abs/2310.20609 (2023) - 2022
- [c12]Guillaume Braun, Hemant Tyagi, Christophe Biernacki:
An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees. ICML 2022: 2257-2291 - 2021
- [j4]Alexandre d'Aspremont, Mihai Cucuringu, Hemant Tyagi:
Ranking and synchronization from pairwise measurements via SVD. J. Mach. Learn. Res. 22: 19:1-19:63 (2021) - [j3]Mihai Cucuringu, Apoorv Vikram Singh, Déborah Sulem, Hemant Tyagi:
Regularized spectral methods for clustering signed networks. J. Mach. Learn. Res. 22: 264:1-264:79 (2021) - [c11]Michaël Fanuel
, Hemant Tyagi:
Recovering Hölder smooth functions from noisy modulo samples. ACSCC 2021: 857-861 - [c10]Guillaume Braun, Hemant Tyagi, Christophe Biernacki:
Clustering multilayer graphs with missing nodes. AISTATS 2021: 2260-2268 - [i12]Guillaume Braun, Hemant Tyagi, Christophe Biernacki:
Clustering multilayer graphs with missing nodes. CoRR abs/2103.03235 (2021) - [i11]Guillaume Braun, Hemant Tyagi, Christophe Biernacki:
An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees. CoRR abs/2112.10467 (2021) - 2020
- [j2]Mihai Cucuringu, Hemant Tyagi:
Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping. J. Mach. Learn. Res. 21: 32:1-32:77 (2020) - [i10]Mihai Cucuringu, Apoorv Vikram Singh, Déborah Sulem, Hemant Tyagi:
Regularized spectral methods for clustering signed networks. CoRR abs/2011.01737 (2020) - [i9]Mihai Cucuringu, Hemant Tyagi:
An extension of the angular synchronization problem to the heterogeneous setting. CoRR abs/2012.14932 (2020)
2010 – 2019
- 2019
- [c9]Mihai Cucuringu, Peter Davies, Aldo Glielmo, Hemant Tyagi:
SPONGE: A generalized eigenproblem for clustering signed networks. AISTATS 2019: 1088-1098 - [i8]Mihai Cucuringu, Peter Davies, Aldo Glielmo, Hemant Tyagi:
SPONGE: A generalized eigenproblem for clustering signed networks. CoRR abs/1904.08575 (2019) - [i7]Alexandre d'Aspremont, Mihai Cucuringu, Hemant Tyagi:
Ranking and synchronization from pairwise measurements via SVD. CoRR abs/1906.02746 (2019) - 2018
- [c8]Mihai Cucuringu, Hemant Tyagi:
On denoising modulo 1 samples of a function. AISTATS 2018: 1868-1876 - [c7]Armin Eftekhari, Jared Tanner, Andrew Thompson, Bogdan Toader, Hemant Tyagi:
Non-Negative Super-Resolution is Stable. DSW 2018: 100-104 - [i6]Armin Eftekhari, Jared Tanner, Andrew Thompson, Bogdan Toader, Hemant Tyagi:
Sparse non-negative super-resolution - simplified and stabilised. CoRR abs/1804.01490 (2018) - [i5]Stéphane Chrétien, Hemant Tyagi:
Multi-kernel unmixing and super-resolution using the Modified Matrix Pencil method. CoRR abs/1807.02862 (2018) - 2016
- [b1]Hemant Tyagi:
On low dimensional models for functions in high dimensions. ETH Zurich, Zürich, Switzerland, 2016 - [j1]Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner:
On Two Continuum Armed Bandit Problems in High Dimensions. Theory Comput. Syst. 58(1): 191-222 (2016) - [c6]Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause:
Learning Sparse Additive Models with Interactions in High Dimensions. AISTATS 2016: 111-120 - [i4]Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause:
Learning Sparse Additive Models with Interactions in High Dimensions. CoRR abs/1604.05307 (2016) - [i3]Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause:
Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions. CoRR abs/1605.00609 (2016) - 2014
- [c5]Hemant Tyagi, Bernd Gärtner, Andreas Krause:
Efficient Sampling for Learning Sparse Additive Models in High Dimensions. NIPS 2014: 514-522 - 2013
- [c4]Hemant Tyagi, Bernd Gärtner:
Continuum Armed Bandit Problem of Few Variables in High Dimensions. WAOA 2013: 108-119 - [i2]Hemant Tyagi, Bernd Gärtner:
Continuum armed bandit problem of few variables in high dimensions. CoRR abs/1304.5793 (2013) - [i1]Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner:
Stochastic continuum armed bandit problem of few linear parameters in high dimensions. CoRR abs/1312.0232 (2013) - 2012
- [c3]Hemant Tyagi, Volkan Cevher:
Learning ridge functions with randomized sampling in high dimensions. ICASSP 2012: 2025-2028 - [c2]Hemant Tyagi, Volkan Cevher:
Active Learning of Multi-Index Function Models. NIPS 2012: 1475-1483
2000 – 2009
- 2006
- [c1]Hemant Tyagi, Rajesh M. Hegde, Hema A. Murthy, Anil Prabhakar:
Automatic identification of bird calls using Spectral Ensemble Average Voice Prints. EUSIPCO 2006: 1-5
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-10-07 22:21 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:
