default search action
Sobhan Miryoosefi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Abhishek Panigrahi, Nikunj Saunshi, Kaifeng Lyu, Sobhan Miryoosefi, Sashank J. Reddi, Satyen Kale, Sanjiv Kumar:
Efficient Stagewise Pretraining via Progressive Subnetworks. CoRR abs/2402.05913 (2024) - [i8]Stefani Karp, Nikunj Saunshi, Sobhan Miryoosefi, Sashank J. Reddi, Sanjiv Kumar:
Landscape-Aware Growing: The Power of a Little LAG. CoRR abs/2406.02469 (2024) - [i7]Nikunj Saunshi, Stefani Karp, Shankar Krishnan, Sobhan Miryoosefi, Sashank J. Reddi, Sanjiv Kumar:
On the Inductive Bias of Stacking Towards Improving Reasoning. CoRR abs/2409.19044 (2024) - 2023
- [c6]Sashank J. Reddi, Sobhan Miryoosefi, Stefani Karp, Shankar Krishnan, Satyen Kale, Seungyeon Kim, Sanjiv Kumar:
Efficient Training of Language Models using Few-Shot Learning. ICML 2023: 14553-14568 - [i6]Renat Aksitov, Sobhan Miryoosefi, Zonglin Li, Daliang Li, Sheila Babayan, Kavya Kopparapu, Zachary Fisher, Ruiqi Guo, Sushant Prakash, Pranesh Srinivasan, Manzil Zaheer, Felix X. Yu, Sanjiv Kumar:
ReST meets ReAct: Self-Improvement for Multi-Step Reasoning LLM Agent. CoRR abs/2312.10003 (2023) - 2022
- [b1]Sobhan Miryoosefi:
Provable Reinforcement Learning with Constraints and Function Approximation. Princeton University, USA, 2022 - [c5]Yonathan Efroni, Chi Jin, Akshay Krishnamurthy, Sobhan Miryoosefi:
Provable Reinforcement Learning with a Short-Term Memory. ICML 2022: 5832-5850 - [c4]Sobhan Miryoosefi, Chi Jin:
A Simple Reward-free Approach to Constrained Reinforcement Learning. ICML 2022: 15666-15698 - [i5]Yonathan Efroni, Chi Jin, Akshay Krishnamurthy, Sobhan Miryoosefi:
Provable Reinforcement Learning with a Short-Term Memory. CoRR abs/2202.03983 (2022) - 2021
- [c3]Chi Jin, Qinghua Liu, Sobhan Miryoosefi:
Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms. NeurIPS 2021: 13406-13418 - [i4]Chi Jin, Qinghua Liu, Sobhan Miryoosefi:
Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms. CoRR abs/2102.00815 (2021) - [i3]Sobhan Miryoosefi, Chi Jin:
A Simple Reward-free Approach to Constrained Reinforcement Learning. CoRR abs/2107.05216 (2021) - 2020
- [c2]Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun:
Constrained episodic reinforcement learning in concave-convex and knapsack settings. NeurIPS 2020 - [i2]Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun:
Constrained episodic reinforcement learning in concave-convex and knapsack settings. CoRR abs/2006.05051 (2020)
2010 – 2019
- 2019
- [c1]Sobhan Miryoosefi, Kianté Brantley, Hal Daumé III, Miroslav Dudík, Robert E. Schapire:
Reinforcement Learning with Convex Constraints. NeurIPS 2019: 14070-14079 - [i1]Sobhan Miryoosefi, Kianté Brantley, Hal Daumé III, Miroslav Dudík, Robert E. Schapire:
Reinforcement Learning with Convex Constraints. CoRR abs/1906.09323 (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-10-18 19:33 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: