default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKamiar Rahnama Rad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Arnab Auddy
, Haolin Zou, Kamiar Rahnama Rad, Arian Maleki:
Approximate Leave-One-Out Cross Validation for Regression With ℓ₁ Regularizers. IEEE Trans. Inf. Theory 70(11): 8040-8071 (2024)- [c7]Arnab Auddy, Haolin Zou, Kamiar Rahnama Rad, Arian Maleki:
Approximate Leave-one-out Cross Validation for Regression with ℓ1 Regularizers. AISTATS 2024: 2377-2385 - 2021
- [j5]Ji Xu, Arian Maleki, Kamiar Rahnama Rad, Daniel Hsu:
Consistent Risk Estimation in Moderately High-Dimensional Linear Regression. IEEE Trans. Inf. Theory 67(9): 5997-6030 (2021) - 2020
- [c6]Kamiar Rahnama Rad, Wenda Zhou, Arian Maleki:
Error bounds in estimating the out-of-sample prediction error using leave-one-out cross validation in high-dimensions. AISTATS 2020: 4067-4077 - [i3]Kamiar Rahnama Rad, Wenda Zhou, Arian Maleki:
Error bounds in estimating the out-of-sample prediction error using leave-one-out cross validation in high-dimensions. CoRR abs/2003.01770 (2020)
2010 – 2019
- 2019
- [i2]Ji Xu, Arian Maleki, Kamiar Rahnama Rad:
Consistent Risk Estimation in High-Dimensional Linear Regression. CoRR abs/1902.01753 (2019) - 2013
- [j4]Pooya Molavi, Ali Jadbabaie, Kamiar Rahnama Rad, Alireza Tahbaz-Salehi:
Reaching Consensus With Increasing Information. IEEE J. Sel. Top. Signal Process. 7(2): 358-369 (2013) - 2012
- [c5]Pooya Molavi, Kamiar Rahnama Rad, Alireza Tahbaz-Salehi, Ali Jadbabaie:
On consensus and exponentially fast social learning. ACC 2012: 2165-2170 - [c4]Liam Paninski, Kamiar Rahnama Rad, Michael Vidne:
Robust particle filters via sequential pairwise reparameterized Gibbs sampling. CISS 2012: 1-6 - 2011
- [j3]Kamiar Rahnama Rad:
Nearly Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery. IEEE Trans. Inf. Theory 57(7): 4672-4679 (2011) - [c3]Kamiar Rahnama Rad, Liam Paninski:
Information Rates and Optimal Decoding in Large Neural Populations. NIPS 2011: 846-854 - 2010
- [j2]Liam Paninski, Yashar Ahmadian, Daniel Gil Ferreira, Shinsuke Koyama, Kamiar Rahnama Rad, Michael Vidne, Joshua T. Vogelstein, Wei Wu:
A new look at state-space models for neural data. J. Comput. Neurosci. 29(1-2): 107-126 (2010) - [c2]Kamiar Rahnama Rad, Alireza Tahbaz-Salehi:
Distributed parameter estimation in networks. CDC 2010: 5050-5055
2000 – 2009
- 2009
- [j1]Taro Toyoizumi, Kamiar Rahnama Rad, Liam Paninski:
Mean-Field Approximations for Coupled Populations of Generalized Linear Model Spiking Neurons with Markov Refractoriness. Neural Comput. 21(5): 1203-1243 (2009) - [c1]Kamiar Rahnama Rad:
Sharp upper bound on error probability of exact sparsity recovery. CISS 2009: 14-17 - [i1]Kamiar Rahnama Rad:
Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery. CoRR abs/0910.0456 (2009)
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 2025-01-09 12:52 CET 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:
