default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHisham Husain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Sameera Ramasinghe, Violetta Shevchenko, Gil Avraham, Hisham Husain, Anton van den Hengel:
Improving the Convergence of Dynamic NeRFs via Optimal Transport. ICLR 2024- [i11]Alexander Soen, Hisham Husain, Philip Schulz, Vu Nguyen:
Rejection via Learning Density Ratios. CoRR abs/2405.18686 (2024) - [i10]Yixin Liu, Thalaiyasingam Ajanthan, Hisham Husain, Vu Nguyen:
Self-Supervision Improves Diffusion Models for Tabular Data Imputation. CoRR abs/2407.18013 (2024) - [i9]Hisham Husain, Julien Monteil:
Geometric Collaborative Filtering with Convergence. CoRR abs/2410.03064 (2024) - 2023
- [c9]Peixia Li, Pulak Purkait, Thalaiyasingam Ajanthan, Majid Abdolshah, Ravi Garg, Hisham Husain, Chenchen Xu, Stephen Gould, Wanli Ouyang, Anton van den Hengel:
Semi-Supervised Semantic Segmentation under Label Noise via Diverse Learning Groups. ICCV 2023: 1229-1238 - [c8]Alexander Soen, Hisham Husain, Richard Nock:
Fair Densities via Boosting the Sufficient Statistics of Exponential Families. ICML 2023: 32105-32144 - [c7]Hisham Husain, Vu Nguyen, Anton van den Hengel:
Distributionally Robust Bayesian Optimization with φ-divergences. NeurIPS 2023 - 2022
- [c6]Hisham Husain, Jeremias Knoblauch:
Adversarial Interpretation of Bayesian Inference. ALT 2022: 553-572 - [i8]Hisham Husain, Vu Nguyen, Anton van den Hengel:
Distributionally Robust Bayesian Optimization with φ-divergences. CoRR abs/2203.02128 (2022) - 2021
- [c5]Hisham Husain, Kamil Ciosek, Ryota Tomioka:
Regularized Policies are Reward Robust. AISTATS 2021: 64-72 - [i7]Hisham Husain, Kamil Ciosek, Ryota Tomioka:
Regularized Policies are Reward Robust. CoRR abs/2101.07012 (2021) - 2020
- [c4]Hisham Husain, Borja Balle, Zac Cranko, Richard Nock:
Local Differential Privacy for Sampling. AISTATS 2020: 3404-3413 - [c3]Jeremias Knoblauch, Hisham Husain, Tom Diethe:
Optimal Continual Learning has Perfect Memory and is NP-hard. ICML 2020: 5327-5337 - [c2]Hisham Husain:
Distributional Robustness with IPMs and links to Regularization and GANs. NeurIPS 2020 - [i6]Hisham Husain:
Distributional Robustness with IPMs and links to Regularization and GANs. CoRR abs/2006.04349 (2020) - [i5]Jeremias Knoblauch, Hisham Husain, Tom Diethe:
Optimal Continual Learning has Perfect Memory and is NP-hard. CoRR abs/2006.05188 (2020) - [i4]Zakaria Mhammedi, Hisham Husain:
Risk-Monotonicity via Distributional Robustness. CoRR abs/2011.14126 (2020) - [i3]Alexander Soen, Hisham Husain, Richard Nock:
Data Preprocessing to Mitigate Bias with Boosted Fair Mollifiers. CoRR abs/2012.00188 (2020)
2010 – 2019
- 2019
- [c1]Hisham Husain, Richard Nock, Robert C. Williamson:
A Primal-Dual link between GANs and Autoencoders. NeurIPS 2019: 413-422 - [i2]Hisham Husain, Richard Nock, Robert C. Williamson:
Adversarial Networks and Autoencoders: The Primal-Dual Relationship and Generalization Bounds. CoRR abs/1902.00985 (2019) - 2018
- [i1]Hisham Husain, Zac Cranko, Richard Nock:
Integral Privacy for Density Estimation with Approximation Guarantees. CoRR abs/1806.04819 (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-11-08 20:32 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:
