default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlnura Usmanova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Ilnura Usmanova:
Safe Learning via Constrained Stochastic Optimization. ETH Zurich, Zürich, Switzerland, 2022
Journal Articles
- 2024
- [j3]Ilnura Usmanova, Yarden As, Maryam Kamgarpour, Andreas Krause:
Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning. J. Mach. Learn. Res. 25: 171:1-171:54 (2024) - 2017
- [j2]Alexander V. Gasnikov, Ekaterina A. Krymova
, Anastasia A. Lagunovskaya, Ilnura Usmanova, Fedor A. Fedorenko:
Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case. Autom. Remote. Control. 78(2): 224-234 (2017) - 2016
- [j1]Alexander V. Gasnikov, Anastasia A. Lagunovskaya, Ilnura Usmanova, Fedor A. Fedorenko:
Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex. Autom. Remote. Control. 77(11): 2018-2034 (2016)
Conference and Workshop Papers
- 2024
- [c6]Navdeep Kumar, Ilnura Usmanova, Kfir Yehuda Levy, Shie Mannor:
Towards Faster Global Convergence of Robust Policy Gradient Methods. Tiny Papers @ ICLR 2024 - 2022
- [c5]Yarden As, Ilnura Usmanova, Sebastian Curi, Andreas Krause:
Constrained Policy Optimization via Bayesian World Models. ICLR 2022 - 2021
- [c4]Ilnura Usmanova, Maryam Kamgarpour, Andreas Krause, Kfir Y. Levy:
Fast Projection Onto Convex Smooth Constraints. ICML 2021: 10476-10486 - [c3]Anastasia Makarova, Ilnura Usmanova, Ilija Bogunovic, Andreas Krause:
Risk-averse Heteroscedastic Bayesian Optimization. NeurIPS 2021: 17235-17245 - 2020
- [c2]Ilnura Usmanova, Andreas Krause, Maryam Kamgarpour:
Safe non-smooth black-box optimization with application to policy search. L4DC 2020: 980-989 - 2019
- [c1]Ilnura Usmanova, Andreas Krause, Maryam Kamgarpour:
Safe Convex Learning under Uncertain Constraints. AISTATS 2019: 2106-2114
Informal and Other Publications
- 2022
- [i5]Yarden As, Ilnura Usmanova, Sebastian Curi, Andreas Krause:
Constrained Policy Optimization via Bayesian World Models. CoRR abs/2201.09802 (2022) - [i4]Ilnura Usmanova, Yarden As, Maryam Kamgarpour, Andreas Krause:
Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning. CoRR abs/2207.10415 (2022) - 2021
- [i3]Anastasia Makarova, Ilnura Usmanova, Ilija Bogunovic, Andreas Krause:
Risk-averse Heteroscedastic Bayesian Optimization. CoRR abs/2111.03637 (2021) - 2019
- [i2]Ilnura Usmanova, Andreas Krause, Maryam Kamgarpour:
Safe non-smooth black-box optimization with application to policy search. CoRR abs/1912.09466 (2019) - [i1]Ilnura Usmanova, Andreas Krause, Maryam Kamgarpour:
Log Barriers for Safe Non-convex Black-box Optimization. CoRR abs/1912.09478 (2019)
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-18 00:12 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:
