


default search action
Anuran Makur
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Shao-Lun Huang, Anuran Makur, Gregory W. Wornell, Lizhong Zheng:
Universal Features for High-Dimensional Learning and Inference. Found. Trends Commun. Inf. Theory 21(1-2): 1-299 (2024) - [j14]Anuran Makur
, Japneet Singh
:
Doeblin Coefficients and Related Measures. IEEE Trans. Inf. Theory 70(7): 4667-4692 (2024) - [j13]William Lu
, Anuran Makur
:
Permutation Capacity Region of Adder Multiple-Access Channels. IEEE Trans. Inf. Theory 70(7): 4693-4720 (2024) - [j12]Ali Jadbabaie
, Anuran Makur
, Devavrat Shah
:
Estimation of Skill Distributions. IEEE Trans. Inf. Theory 70(9): 6447-6480 (2024) - [j11]Kamyar Azizzadenesheli, William Lu, Anuran Makur, Qian Zhang:
Sparse Contextual CDF Regression. Trans. Mach. Learn. Res. 2024 (2024) - [j10]Qian Zhang, Anuran Makur, Kamyar Azizzadenesheli:
Functional Linear Regression of Cumulative Distribution Functions. Trans. Mach. Learn. Res. 2024 (2024) - [c23]Dongmin Lee, Anuran Makur:
Contraction Coefficients of Product Symmetric Channels. Allerton 2024: 1-8 - [c22]William Lu, Anuran Makur, Japneet Singh:
On Doeblin Curves and Their Properties. ISIT 2024: 2544-2549 - [c21]William Lu, Anuran Makur:
On Permutation Capacity Regions of Multiple-Access Channels. ISIT 2024: 3142-3147 - [c20]Kaiyuan Zhang, Siyuan Cheng, Guangyu Shen, Guanhong Tao, Shengwei An, Anuran Makur, Shiqing Ma, Xiangyu Zhang:
Exploring the Orthogonality and Linearity of Backdoor Attacks. SP 2024: 2105-2123 - [i19]Anuran Makur, Japneet Singh:
Minimax Hypothesis Testing for the Bradley-Terry-Luce Model. CoRR abs/2410.08360 (2024) - 2023
- [j9]Ali Jadbabaie
, Anuran Makur
, Elchanan Mossel
, Rabih Salhab
:
Inference in Opinion Dynamics Under Social Pressure. IEEE Trans. Autom. Control. 68(6): 3377-3392 (2023) - [j8]Ali Jadbabaie
, Anuran Makur
, Devavrat Shah
:
Federated Optimization of Smooth Loss Functions. IEEE Trans. Inf. Theory 69(12): 7836-7866 (2023) - [c19]Romain Cosson, Ali Jadbabaie, Anuran Makur, Amirhossein Reisizadeh, Devavrat Shah:
Gradient Descent with Low-Rank Objective Functions. CDC 2023: 3309-3314 - [c18]Ali Jadbabaie, Anuran Makur, Amirhossein Reisizadeh:
Adaptive Low-Rank Gradient Descent. CDC 2023: 3315-3320 - [c17]Anuran Makur, Japneet Singh:
On Properties of Doeblin Coefficients. ISIT 2023: 72-77 - [c16]William Lu, Anuran Makur:
Permutation Sum-Capacity of Binary Adder Multiple-Access Channels. ISIT 2023: 933-938 - [c15]Anuran Makur, Japneet Singh:
Testing for the Bradley-Terry-Luce Model. ISIT 2023: 1390-1395 - [c14]Anuran Makur, Marios Mertzanidis, Alexandros Psomas, Athina Terzoglou:
On the Robustness of Mechanism Design under Total Variation Distance. NeurIPS 2023 - [i18]William Lu, Anuran Makur:
Permutation Capacity Region of Adder Multiple-Access Channels. CoRR abs/2309.08054 (2023) - [i17]Anuran Makur, Japneet Singh:
Doeblin Coefficients and Related Measures. CoRR abs/2309.08475 (2023) - [i16]Anuran Makur, Marios Mertzanidis, Alexandros Psomas, Athina Terzoglou:
On the Robustness of Mechanism Design under Total Variation Distance. CoRR abs/2310.07809 (2023) - 2022
- [j7]Anuran Makur
, Elchanan Mossel
, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. IEEE Trans. Inf. Theory 68(10): 6297-6334 (2022) - [i15]Ali Jadbabaie, Anuran Makur, Devavrat Shah:
Federated Optimization of Smooth Loss Functions. CoRR abs/2201.01954 (2022) - [i14]Qian Zhang, Anuran Makur, Kamyar Azizzadenesheli:
Functional Linear Regression of CDFs. CoRR abs/2205.14545 (2022) - [i13]Romain Cosson, Ali Jadbabaie, Anuran Makur, Amirhossein Reisizadeh, Devavrat Shah:
Gradient Descent for Low-Rank Functions. CoRR abs/2206.08257 (2022) - 2021
- [c13]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Reconstruction on 2D Regular Grids. ISIT 2021: 2107-2112 - [i12]Ali Jadbabaie, Anuran Makur, Elchanan Mossel, Rabih Salhab:
Opinion Dynamics under Social Pressure. CoRR abs/2104.11172 (2021) - 2020
- [j6]Anuran Makur, L. Zheng:
Comparison of Contraction Coefficients for f-Divergences. Probl. Inf. Transm. 56(2): 103-156 (2020) - [j5]Anuran Makur
, Elchanan Mossel, Yury Polyanskiy
:
Broadcasting on Random Directed Acyclic Graphs. IEEE Trans. Inf. Theory 66(2): 780-812 (2020) - [j4]Anuran Makur
:
Coding Theorems for Noisy Permutation Channels. IEEE Trans. Inf. Theory 66(11): 6723-6748 (2020) - [c12]Anuran Makur:
Bounds on Permutation Channel Capacity. ISIT 2020: 2026-2031 - [c11]Anuran Makur, Gregory W. Wornell, Lizhong Zheng:
On Estimation of Modal Decompositions. ISIT 2020: 2717-2722 - [c10]Ali Jadbabaie, Anuran Makur, Devavrat Shah:
Estimation of Skill Distribution from a Tournament. NeurIPS 2020 - [i11]Ali Jadbabaie, Anuran Makur, Devavrat Shah:
Estimation of Skill Distributions. CoRR abs/2006.08189 (2020) - [i10]Anuran Makur:
Coding Theorems for Noisy Permutation Channels. CoRR abs/2007.07507 (2020) - [i9]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. CoRR abs/2010.01390 (2020) - [i8]Ali Jadbabaie, Anuran Makur, Devavrat Shah:
Gradient-Based Empirical Risk Minimization using Local Polynomial Regression. CoRR abs/2011.02522 (2020)
2010 – 2019
- 2019
- [c9]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Networks. ISIT 2019: 1632-1636 - [i7]Shao-Lun Huang, Anuran Makur, Gregory W. Wornell, Lizhong Zheng:
On Universal Features for High-Dimensional Learning and Inference. CoRR abs/1911.09105 (2019) - 2018
- [j3]Anuran Makur
, Yury Polyanskiy:
Comparison of Channels: Criteria for Domination by a Symmetric Channel. IEEE Trans. Inf. Theory 64(8): 5704-5725 (2018) - [c8]David Qiu, Anuran Makur, Lizhong Zheng:
Probabilistic Clustering using Maximal Matrix Norm Couplings. Allerton 2018: 1020-1027 - [c7]Anuran Makur:
Information Capacity of BSC and BEC Permutation Channels. Allerton 2018: 1112-1119 - [i6]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Bounded Degree DAGs. CoRR abs/1803.07527 (2018) - [i5]David Qiu, Anuran Makur, Lizhong Zheng:
Probabilistic Clustering Using Maximal Matrix Norm Couplings. CoRR abs/1810.04738 (2018) - [i4]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. CoRR abs/1811.03946 (2018) - 2017
- [j2]Anuran Makur
, Lizhong Zheng:
Polynomial Singular Value Decompositions of a Family of Source-Channel Models. IEEE Trans. Inf. Theory 63(12): 7716-7728 (2017) - [c6]Shao-Lun Huang, Anuran Makur, Lizhong Zheng, Gregory W. Wornell:
An information-theoretic approach to universal feature selection in high-dimensional inference. ISIT 2017: 1336-1340 - [c5]Anuran Makur, Yury Polyanskiy:
Less noisy domination by symmetric channels. ISIT 2017: 2463-2467 - 2016
- [c4]Anuran Makur, Lizhong Zheng:
Polynomial spectral decomposition of conditional expectation operators. Allerton 2016: 633-640 - [i3]Anuran Makur, Yury Polyanskiy:
Comparison of channels: criteria for domination by a symmetric channel. CoRR abs/1609.06877 (2016) - 2015
- [c3]Anuran Makur, Fabian Kozynski, Shao-Lun Huang, Lizhong Zheng:
An efficient algorithm for information decomposition and extraction. Allerton 2015: 972-979 - [c2]Anuran Makur, Lizhong Zheng:
Bounds between contraction coefficients. Allerton 2015: 1422-1429 - [i2]Tarek A. Lahlou, Anuran Makur:
Transient Signal Spaces and Decompositions. CoRR abs/1509.05696 (2015) - [i1]Anuran Makur, Lizhong Zheng:
Bounds between Contraction Coefficients. CoRR abs/1510.01844 (2015) - 2014
- [j1]Anuran Makur:
Complex robust whitening with application to blind identification of same DoA multipath. Signal Process. 94: 514-520 (2014) - [c1]Shao-Lun Huang, Anuran Makur, Fabian Kozynski, Lizhong Zheng:
Efficient statistics: Extracting information from IID observations. Allerton 2014: 699-706
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-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint