default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahdi Haghifam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Milad Hoseinpour
, Mohammad Hoseinpour, Mahdi Haghifam, Mahmoud-Reza Haghifam:
Privacy-Preserving and Approximately Truthful Local Electricity Markets: A Differentially Private VCG Mechanism. IEEE Trans. Smart Grid 15(2): 1991-2003 (2024)- [c10]Idan Attias, Gintare Karolina Dziugaite, Mahdi Haghifam, Roi Livni, Daniel M. Roy:
Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing. ICML 2024 - [i14]Idan Attias, Gintare Karolina Dziugaite, Mahdi Haghifam, Roi Livni, Daniel M. Roy:
Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization. CoRR abs/2402.09327 (2024) - [i13]Mahdi Haghifam, Thomas Steinke, Jonathan R. Ullman:
Private Geometric Median. CoRR abs/2406.07407 (2024) - 2023
- [c9]Mahdi Haghifam, Borja Rodríguez Gálvez, Ragnar Thobaben, Mikael Skoglund, Daniel M. Roy, Gintare Karolina Dziugaite:
Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization. ALT 2023: 663-706 - [c8]Arun Ganesh, Mahdi Haghifam, Milad Nasr, Sewoong Oh, Thomas Steinke, Om Thakkar, Abhradeep Guha Thakurta, Lun Wang:
Why Is Public Pretraining Necessary for Private Model Training? ICML 2023: 10611-10627 - [c7]Arun Ganesh, Mahdi Haghifam, Thomas Steinke, Abhradeep Guha Thakurta:
Faster Differentially Private Convex Optimization via Second-Order Methods. NeurIPS 2023 - [i12]Arun Ganesh, Mahdi Haghifam, Milad Nasr, Sewoong Oh, Thomas Steinke, Om Thakkar, Abhradeep Thakurta, Lun Wang:
Why Is Public Pretraining Necessary for Private Model Training? CoRR abs/2302.09483 (2023) - [i11]Arun Ganesh, Mahdi Haghifam, Thomas Steinke, Abhradeep Thakurta:
Faster Differentially Private Convex Optimization via Second-Order Methods. CoRR abs/2305.13209 (2023) - 2022
- [c6]Mahdi Haghifam, Shay Moran, Daniel M. Roy, Gintare Karolina Dziugaite:
Understanding Generalization via Leave-One-Out Conditional Mutual Information. ISIT 2022: 2487-2492 - [i10]Mahdi Haghifam, Shay Moran, Daniel M. Roy, Gintare Karolina Dziugaite:
Understanding Generalization via Leave-One-Out Conditional Mutual Information. CoRR abs/2206.14800 (2022) - [i9]Mahdi Haghifam, Borja Rodríguez Gálvez, Ragnar Thobaben, Mikael Skoglund, Daniel M. Roy, Gintare Karolina Dziugaite:
Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization. CoRR abs/2212.13556 (2022) - 2021
- [j3]Mahdi Haghifam, M. Nikhil Krishnan, Ashish Khisti, Xiaoqing Zhu, Wai-Tian Tan, John G. Apostolopoulos:
On Streaming Codes With Unequal Error Protection. IEEE J. Sel. Areas Inf. Theory 2(4): 1165-1179 (2021) - [j2]Mahdi Haghifam, Vincent Y. F. Tan, Ashish Khisti:
Sequential Classification With Empirically Observed Statistics. IEEE Trans. Inf. Theory 67(5): 3095-3113 (2021) - [c5]Mahdi Haghifam, Gintare Karolina Dziugaite, Shay Moran, Daniel M. Roy:
Towards a Unified Information-Theoretic Framework for Generalization. NeurIPS 2021: 26370-26381 - [i8]Mahdi Haghifam, Gintare Karolina Dziugaite, Shay Moran, Daniel M. Roy:
Towards a Unified Information-Theoretic Framework for Generalization. CoRR abs/2111.05275 (2021) - 2020
- [c4]Mahdi Haghifam, Jeffrey Negrea, Ashish Khisti, Daniel M. Roy, Gintare Karolina Dziugaite:
Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms. NeurIPS 2020 - [i7]Mahdi Haghifam, Jeffrey Negrea, Ashish Khisti, Daniel M. Roy, Gintare Karolina Dziugaite:
Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms. CoRR abs/2004.12983 (2020) - [i6]Mahdi Haghifam, Gintare Karolina Dziugaite, Shay Moran, Daniel M. Roy:
On the Information Complexity of Proper Learners for VC Classes in the Realizable Case. CoRR abs/2011.02970 (2020)
2010 – 2019
- 2019
- [c3]Mahdi Haghifam, Vincent Y. F. Tan, Ashish Khisti:
Sequential Classification with Empirically Observed Statistics. ITW 2019: 1-5 - [c2]Jeffrey Negrea, Mahdi Haghifam, Gintare Karolina Dziugaite, Ashish Khisti, Daniel M. Roy:
Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates. NeurIPS 2019: 11013-11023 - [i5]Jeffrey Negrea, Mahdi Haghifam, Gintare Karolina Dziugaite, Ashish Khisti, Daniel M. Roy:
Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates. CoRR abs/1911.02151 (2019) - [i4]Mahdi Haghifam, Vincent Y. F. Tan, Ashish Khisti:
Sequential Classification with Empirically Observed Statistics. CoRR abs/1912.01170 (2019) - 2017
- [j1]Mahdi Haghifam, Mohammad Robat Mili, Behrooz Makki, Masoumeh Nasiri-Kenari, Tommy Svensson:
Joint Sum Rate and Error Probability Optimization: Finite Blocklength Analysis. IEEE Wirel. Commun. Lett. 6(6): 726-729 (2017) - [i3]Mahdi Haghifam, Mohammad Robat Mili, Behrooz Makki, Masoumeh Nasiri-Kenari, Tommy Svensson:
Joint Sum Rate And Error Probability Optimization: Finite Blocklength Analysis. CoRR abs/1707.09735 (2017) - 2016
- [c1]Mahdi Haghifam, Behrooz Makki, Masoumeh Nasiri-Kenari, Tommy Svensson:
On joint energy and information transfer in relay networks with an imperfect power amplifier. PIMRC 2016: 1-6 - [i2]Mahdi Haghifam, Behrooz Makki, Masoumeh Nasiri-Kenari, Tommy Svensson:
On Wireless Energy and Information Transfer in Relay Networks. CoRR abs/1607.07087 (2016) - [i1]Mahdi Haghifam, Behrooz Makki, Masoumeh Nasiri-Kenari, Tommy Svensson, Michele Zorzi:
Wireless-powered relaying with finite block-length codes. CoRR abs/1611.05995 (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-09-04 00:30 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:
