default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnqi Mao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Theoretically Grounded Loss Functions and Algorithms for Score-Based Multi-Class Abstention. AISTATS 2024: 4753-4761- [c15]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithms. ALT 2024: 822-867 - [c14]Christopher Mohri, Daniel Andor, Eunsol Choi, Michael Collins, Anqi Mao, Yutao Zhong:
Learning to Reject with a Fixed Predictor: Application to Decontextualization. ICLR 2024 - [c13]Raef Bassily, Corinna Cortes, Anqi Mao, Mehryar Mohri:
Differentially Private Domain Adaptation with Theoretical Guarantees. ICML 2024 - [c12]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Regression with Multi-Expert Deferral. ICML 2024 - [c11]Anqi Mao, Mehryar Mohri, Yutao Zhong:
H-Consistency Guarantees for Regression. ICML 2024 - [c10]Anqi Mao
, Mehryar Mohri, Yutao Zhong:
Principled Approaches for Learning to Defer with Multiple Experts. ISAIM 2024: 107-135 - [i18]Anqi Mao, Mehryar Mohri, Yutao Zhong:
H-Consistency Guarantees for Regression. CoRR abs/2403.19480 (2024) - [i17]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Regression with Multi-Expert Deferral. CoRR abs/2403.19494 (2024) - [i16]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Top-k Classification and Cardinality-Aware Prediction. CoRR abs/2403.19625 (2024) - [i15]Anqi Mao, Mehryar Mohri, Yutao Zhong:
A Universal Growth Rate for Learning with Smooth Surrogate Losses. CoRR abs/2405.05968 (2024) - [i14]Corinna Cortes, Anqi Mao, Christopher Mohri, Mehryar Mohri, Yutao Zhong:
Cardinality-Aware Set Prediction and Top-k Classification. CoRR abs/2407.07140 (2024) - [i13]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Enhanced H-Consistency Bounds. CoRR abs/2407.13722 (2024) - [i12]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Realizable H-Consistent and Bayes-Consistent Loss Functions for Learning to Defer. CoRR abs/2407.13732 (2024) - [i11]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Multi-Label Learning with Stronger Consistency Guarantees. CoRR abs/2407.13746 (2024) - 2023
- [c9]Pranjal Awasthi, Anqi Mao, Mehryar Mohri, Yutao Zhong:
Theoretically Grounded Loss Functions and Algorithms for Adversarial Robustness. AISTATS 2023: 10077-10094 - [c8]Anqi Mao, Mehryar Mohri, Yutao Zhong:
H-Consistency Bounds for Pairwise Misranking Loss Surrogates. ICML 2023: 23743-23802 - [c7]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Cross-Entropy Loss Functions: Theoretical Analysis and Applications. ICML 2023: 23803-23828 - [c6]Anqi Mao, Mehryar Mohri, Yutao Zhong:
H-Consistency Bounds: Characterization and Extensions. NeurIPS 2023 - [c5]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Structured Prediction with Stronger Consistency Guarantees. NeurIPS 2023 - [c4]Anqi Mao, Christopher Mohri, Mehryar Mohri, Yutao Zhong:
Two-Stage Learning to Defer with Multiple Experts. NeurIPS 2023 - [i10]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Cross-Entropy Loss Functions: Theoretical Analysis and Applications. CoRR abs/2304.07288 (2023) - [i9]Raef Bassily, Corinna Cortes, Anqi Mao, Mehryar Mohri:
Differentially Private Domain Adaptation with Theoretical Guarantees. CoRR abs/2306.08838 (2023) - [i8]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Ranking with Abstention. CoRR abs/2307.02035 (2023) - [i7]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Theoretically Grounded Loss Functions and Algorithms for Score-Based Multi-Class Abstention. CoRR abs/2310.14770 (2023) - [i6]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithms. CoRR abs/2310.14772 (2023) - [i5]Anqi Mao, Mehryar Mohri, Yutao Zhong:
Principled Approaches for Learning to Defer with Multiple Experts. CoRR abs/2310.14774 (2023) - 2022
- [c3]Pranjal Awasthi, Anqi Mao, Mehryar Mohri, Yutao Zhong:
H-Consistency Bounds for Surrogate Loss Minimizers. ICML 2022: 1117-1174 - [c2]Pranjal Awasthi, Anqi Mao, Mehryar Mohri, Yutao Zhong:
Multi-Class $H$-Consistency Bounds. NeurIPS 2022 - [i4]Pranjal Awasthi, Anqi Mao, Mehryar Mohri, Yutao Zhong:
H-Consistency Estimation Error of Surrogate Loss Minimizers. CoRR abs/2205.08017 (2022) - 2021
- [c1]Pranjal Awasthi, Natalie Frank, Anqi Mao, Mehryar Mohri, Yutao Zhong:
Calibration and Consistency of Adversarial Surrogate Losses. NeurIPS 2021: 9804-9815 - [i3]Pranjal Awasthi, Natalie Frank, Anqi Mao, Mehryar Mohri, Yutao Zhong:
Calibration and Consistency of Adversarial Surrogate Losses. CoRR abs/2104.09658 (2021) - [i2]Pranjal Awasthi, Anqi Mao, Mehryar Mohri, Yutao Zhong:
A Finer Calibration Analysis for Adversarial Robustness. CoRR abs/2105.01550 (2021) - 2020
- [j2]Yingzhou Li, Jianfeng Lu, Anqi Mao:
Variational training of neural network approximations of solution maps for physical models. J. Comput. Phys. 409: 109338 (2020)
2010 – 2019
- 2019
- [i1]Yingzhou Li, Jianfeng Lu, Anqi Mao:
Variational training of neural network approximations of solution maps for physical models. CoRR abs/1905.02789 (2019) - 2018
- [j1]Ruiping Li, Jing Zhang, Anqi Mao, Ming Li:
Improved Reversible Data hiding based on Encrypted Signals with Public Key Cryptosystem. J. Inf. Hiding Multim. Signal Process. 9(3): 615-619 (2018)
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 01:23 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:
