default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArsen Vasilyan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c13]Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan:
Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions. SODA 2025: 2881-2907- [i15]Surbhi Goel, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Testing Noise Assumptions of Learning Algorithms. CoRR abs/2501.09189 (2025) - 2024
- [c12]Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Testable Learning with Distribution Shift. COLT 2024: 2887-2943 - [c11]Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds. COLT 2024: 2944-2978 - [c10]Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
An Efficient Tester-Learner for Halfspaces. ICLR 2024 - [c9]Gautam Chandrasekaran, Adam R. Klivans, Vasilis Kontonis, Konstantinos Stavropoulos, Arsen Vasilyan:
Efficient Discrepancy Testing for Learning with Distribution Shift. NeurIPS 2024 - [c8]Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan:
Plant-and-Steal: Truthful Fair Allocations via Predictions. NeurIPS 2024 - [c7]Surbhi Goel, Abhishek Shetty, Konstantinos Stavropoulos, Arsen Vasilyan:
Tolerant Algorithms for Learning with Arbitrary Covariate Shift. NeurIPS 2024 - [i14]Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds. CoRR abs/2404.02364 (2024) - [i13]Surbhi Goel, Abhishek Shetty, Konstantinos Stavropoulos, Arsen Vasilyan:
Tolerant Algorithms for Learning with Arbitrary Covariate Shift. CoRR abs/2406.02742 (2024) - [i12]Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan:
Plant-and-Steal: Truthful Fair Allocations via Predictions. CoRR abs/2406.07024 (2024) - [i11]Gautam Chandrasekaran, Adam R. Klivans, Vasilis Kontonis, Konstantinos Stavropoulos, Arsen Vasilyan:
Efficient Discrepancy Testing for Learning with Distribution Shift. CoRR abs/2406.09373 (2024) - [i10]Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Learning Constant-Depth Circuits in Malicious Noise Models. CoRR abs/2411.03570 (2024) - 2023
- [c6]Jane Lange, Arsen Vasilyan:
Agnostic proper learning of monotone functions: beyond the black-box correction barrier. FOCS 2023: 1149-1170 - [c5]Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Tester-Learners for Halfspaces: Universal Algorithms. NeurIPS 2023 - [c4]Ronitt Rubinfeld, Arsen Vasilyan:
Testing Distributional Assumptions of Learning Algorithms. STOC 2023: 1643-1656 - [i9]Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
An Efficient Tester-Learner for Halfspaces. CoRR abs/2302.14853 (2023) - [i8]Jane Lange, Arsen Vasilyan:
Agnostic proper learning of monotone functions: beyond the black-box correction barrier. CoRR abs/2304.02700 (2023) - [i7]Aravind Gollakota, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Tester-Learners for Halfspaces: Universal Algorithms. CoRR abs/2305.11765 (2023) - [i6]Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan:
Local Lipschitz Filters for Bounded-Range Functions. CoRR abs/2308.14716 (2023) - [i5]Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan:
Testable Learning with Distribution Shift. CoRR abs/2311.15142 (2023) - 2022
- [c3]Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan:
Properly learning monotone functions via local correction. FOCS 2022: 75-86 - [i4]Ronitt Rubinfeld, Arsen Vasilyan:
Testing distributional assumptions of learning algorithms. CoRR abs/2204.07196 (2022) - [i3]Jane Lange, Ronitt Rubinfeld, Arsen Vasilyan:
Properly learning monotone functions via local reconstruction. CoRR abs/2204.11894 (2022) - 2020
- [c2]Ronitt Rubinfeld, Arsen Vasilyan:
Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples. ITCS 2020: 28:1-28:34 - [i2]Ronitt Rubinfeld, Arsen Vasilyan:
Monotone probability distributions over the Boolean cube can be learned with sublinear samples. CoRR abs/2002.03415 (2020)
2010 – 2019
- 2019
- [c1]Ronitt Rubinfeld, Arsen Vasilyan:
Approximating the Noise Sensitivity of a Monotone Boolean Function. APPROX-RANDOM 2019: 52:1-52:17 - [i1]Ronitt Rubinfeld, Arsen Vasilyan:
Approximating the noise sensitivity of a monotone Boolean function. CoRR abs/1904.06745 (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 2025-02-24 21:34 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:
