default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatya Scheinberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Liyuan Cao
, Albert S. Berahas, Katya Scheinberg:
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles. Math. Program. 207(1): 55-106 (2024)- [j34]Billy Jin, Katya Scheinberg, Miaolan Xie:
High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles. SIAM J. Optim. 34(3): 2411-2439 (2024) - 2023
- [c16]Katya Scheinberg, Miaolan Xie:
Stochastic Adaptive Regularization Method with Cubics: a High Probability Complexity Bound. WSC 2023: 3520-3531 - 2022
- [j33]Albert S. Berahas, Liyuan Cao, Krzysztof Choromanski, Katya Scheinberg:
A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimization. Found. Comput. Math. 22(2): 507-560 (2022) - [j32]Katya Scheinberg:
Finite Difference Gradient Approximation: To Randomize or Not? INFORMS J. Comput. 34(5): 2384-2388 (2022) - [c15]Trang H. Tran, Katya Scheinberg, Lam M. Nguyen:
Nesterov Accelerated Shuffling Gradient Method for Convex Optimization. ICML 2022: 21703-21732 - [i23]Trang H. Tran, Lam M. Nguyen, Katya Scheinberg:
Nesterov Accelerated Shuffling Gradient Method for Convex Optimization. CoRR abs/2202.03525 (2022) - [i22]Trang H. Tran, Lam M. Nguyen, Katya Scheinberg:
Finding Optimal Policy for Queueing Models: New Parameterization. CoRR abs/2206.10073 (2022) - 2021
- [j31]Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly, Katya Scheinberg:
Optimal decision trees for categorical data via integer programming. J. Glob. Optim. 81(1): 233-260 (2021) - [j30]Lam M. Nguyen, Katya Scheinberg, Martin Takác:
Inexact SARAH algorithm for stochastic optimization. Optim. Methods Softw. 36(1): 237-258 (2021) - [j29]Albert S. Berahas, Liyuan Cao, Katya Scheinberg:
Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise. SIAM J. Optim. 31(2): 1489-1518 (2021) - [c14]Billy Jin, Katya Scheinberg, Miaolan Xie:
High Probability Complexity Bounds for Line Search Based on Stochastic Oracles. NeurIPS 2021: 9193-9203 - 2020
- [j28]Courtney Paquette, Katya Scheinberg:
A Stochastic Line Search Method with Expected Complexity Analysis. SIAM J. Optim. 30(1): 349-376 (2020) - [j27]Frank E. Curtis, Katya Scheinberg:
Adaptive Stochastic Optimization: A Framework for Analyzing Stochastic Optimization Algorithms. IEEE Signal Process. Mag. 37(5): 32-42 (2020) - [i21]Frank E. Curtis, Katya Scheinberg:
Adaptive Stochastic Optimization. CoRR abs/2001.06699 (2020)
2010 – 2019
- 2019
- [j26]Jose H. Blanchet, Coralia Cartis, Matt Menickelly, Katya Scheinberg:
Convergence Rate Analysis of a Stochastic Trust-Region Method via Supermartingales. INFORMS J. Optim. 1(2): 92-119 (2019) - [j25]Frank E. Curtis, Katya Scheinberg, Rui Shi:
A Stochastic Trust Region Algorithm Based on Careful Step Normalization. INFORMS J. Optim. 1(3): 200-220 (2019) - [j24]Lam M. Nguyen, Phuong Ha Nguyen, Peter Richtárik, Katya Scheinberg, Martin Takác, Marten van Dijk:
New Convergence Aspects of Stochastic Gradient Algorithms. J. Mach. Learn. Res. 20: 176:1-176:49 (2019) - [i20]Hiva Ghanbari, Minhan Li, Katya Scheinberg:
Novel and Efficient Approximations for Zero-One Loss of Linear Classifiers. CoRR abs/1903.00359 (2019) - [i19]Mohammad Pirhooshyaran, Lawrence V. Snyder, Katya Scheinberg:
Feature Engineering and Forecasting via Integration of Derivative-free Optimization and Ensemble of Sequence-to-sequence Networks: Renewable Energy Case Studies. CoRR abs/1909.05447 (2019) - [i18]Kostas Hatalis, Alberto J. Lamadrid, Katya Scheinberg, Shalinee Kishore:
A Novel Smoothed Loss and Penalty Function for Noncrossing Composite Quantile Estimation via Deep Neural Networks. CoRR abs/1909.12122 (2019) - 2018
- [j23]Hiva Ghanbari, Katya Scheinberg:
Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. Comput. Optim. Appl. 69(3): 597-627 (2018) - [j22]Coralia Cartis, Katya Scheinberg:
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169(2): 337-375 (2018) - [j21]Ruobing Chen, Matt Menickelly, Katya Scheinberg:
Stochastic optimization using a trust-region method and random models. Math. Program. 169(2): 447-487 (2018) - [c13]Lam M. Nguyen, Phuong Ha Nguyen, Marten van Dijk, Peter Richtárik, Katya Scheinberg, Martin Takác:
SGD and Hogwild! Convergence Without the Bounded Gradients Assumption. ICML 2018: 3747-3755 - [i17]Lam M. Nguyen, Nam H. Nguyen, Dzung T. Phan, Jayant R. Kalagnanam, Katya Scheinberg:
When Does Stochastic Gradient Algorithm Work Well? CoRR abs/1801.06159 (2018) - [i16]Hiva Ghanbari, Katya Scheinberg:
Directly and Efficiently Optimizing Prediction Error and AUC of Linear Classifiers. CoRR abs/1802.02535 (2018) - [i15]Lam M. Nguyen, Phuong Ha Nguyen, Marten van Dijk, Peter Richtárik, Katya Scheinberg, Martin Takác:
SGD and Hogwild! Convergence Without the Bounded Gradients Assumption. CoRR abs/1802.03801 (2018) - [i14]Kostas Hatalis, Shalinee Kishore, Katya Scheinberg, Alberto J. Lamadrid:
An Empirical Analysis of Constrained Support Vector Quantile Regression for Nonparametric Probabilistic Forecasting of Wind Power. CoRR abs/1803.10888 (2018) - [i13]Lam M. Nguyen, Katya Scheinberg, Martin Takác:
Inexact SARAH Algorithm for Stochastic Optimization. CoRR abs/1811.10105 (2018) - [i12]Lam M. Nguyen, Phuong Ha Nguyen, Peter Richtárik, Katya Scheinberg, Martin Takác, Marten van Dijk:
New Convergence Aspects of Stochastic Gradient Algorithms. CoRR abs/1811.12403 (2018) - 2017
- [j20]Adriano Verdério, Elizabeth W. Karas, Lucas G. Pedroso, Katya Scheinberg:
On the construction of quadratic models for derivative-free trust-region algorithms. EURO J. Comput. Optim. 5(4): 501-527 (2017) - [c12]Kostas Hatalis, Shalinee Kishore, Katya Scheinberg, Alberto J. Lamadrid:
An Empirical Analysis of Constrained Support Vector Quantile Regression for Nonparametric Probabilistic Forecasting of Wind Power. AAAI Workshops 2017 - [c11]Dzung T. Phan, Tsuyoshi Idé, Jayant Kalagnanam, Matt Menickelly, Katya Scheinberg:
A Novel l0-Constrained Gaussian Graphical Model for Anomaly Localization. ICDM Workshops 2017: 830-833 - [c10]Lam M. Nguyen, Jie Liu, Katya Scheinberg, Martin Takác:
SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient. ICML 2017: 2613-2621 - [i11]Lam M. Nguyen, Jie Liu, Katya Scheinberg, Martin Takác:
SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient. CoRR abs/1703.00102 (2017) - [i10]Hiva Ghanbari, Katya Scheinberg:
Black-Box Optimization in Machine Learning with Trust Region Based Derivative Free Algorithm. CoRR abs/1703.06925 (2017) - [i9]Lam M. Nguyen, Jie Liu, Katya Scheinberg, Martin Takác:
Stochastic Recursive Gradient Algorithm for Nonconvex Optimization. CoRR abs/1705.07261 (2017) - [i8]Frank E. Curtis, Katya Scheinberg:
Optimization Methods for Supervised Machine Learning: From Linear Models to Deep Learning. CoRR abs/1706.10207 (2017) - 2016
- [j19]Katya Scheinberg, Xiaocheng Tang:
Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160(1-2): 495-529 (2016) - [i7]Hiva Ghanbari, Katya Scheinberg:
Proximal Quasi-Newton Methods for Convex Optimization. CoRR abs/1607.03081 (2016) - [i6]Matt Menickelly, Oktay Günlük, Jayant Kalagnanam, Katya Scheinberg:
Optimal Generalized Decision Trees via Integer Programming. CoRR abs/1612.03225 (2016) - 2015
- [c9]Ziyi Guo, Katya Scheinberg, Juliana Hong, Brian Yuan Chen:
Superposition of protein structures using electrostatic isopotentials. BIBM 2015: 75-82 - [c8]Priya Govindan, Ruobing Chen, Katya Scheinberg, Soundararajan Srinivasan:
A scalable solution for group feature selection. IEEE BigData 2015: 2846-2848 - 2014
- [j18]Katya Scheinberg, Donald Goldfarb, Xi Bai:
Fast First-Order Methods for Composite Convex Optimization with Backtracking. Found. Comput. Math. 14(3): 389-417 (2014) - [j17]Afonso S. Bandeira, Katya Scheinberg, Luís Nunes Vicente:
Convergence of Trust-Region Methods Based on Probabilistic Models. SIAM J. Optim. 24(3): 1238-1264 (2014) - 2013
- [j16]Donald Goldfarb, Shiqian Ma, Katya Scheinberg:
Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Program. 141(1-2): 349-382 (2013) - [j15]Zhiwei (Tony) Qin, Katya Scheinberg, Donald Goldfarb:
Efficient block-coordinate descent algorithms for the Group Lasso. Math. Program. Comput. 5(2): 143-169 (2013) - [i5]Xiaocheng Tang, Katya Scheinberg:
Efficiently Using Second Order Information in Large l1 Regularization Problems. CoRR abs/1303.6935 (2013) - [i4]Afonso S. Bandeira, Katya Scheinberg, Luís Nunes Vicente:
On partial sparse recovery. CoRR abs/1304.2809 (2013) - [i3]Katya Scheinberg, Xiaocheng Tang:
Complexity of Inexact Proximal Newton methods. CoRR abs/1311.6547 (2013) - 2012
- [j14]Afonso S. Bandeira, Katya Scheinberg, Luís Nunes Vicente:
Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization. Math. Program. 134(1): 223-257 (2012) - [c7]Ruobing Chen, Katya Scheinberg, Brian Yuan Chen:
Aligning ligand binding cavities by optimizing superposed volume. BIBM 2012: 1-5 - 2010
- [j13]Katya Scheinberg, Philippe L. Toint:
Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization. SIAM J. Optim. 20(6): 3512-3532 (2010) - [j12]Hongchao Zhang, Andrew R. Conn, Katya Scheinberg:
A Derivative-Free Algorithm for Least-Squares Minimization. SIAM J. Optim. 20(6): 3555-3576 (2010) - [c6]Katya Scheinberg, Irina Rish, Narges Bani Asadi:
Sparse Markov net learning with priors on regularization parameters. ISAIM 2010 - [c5]Katya Scheinberg, Shiqian Ma, Donald Goldfarb:
Sparse Inverse Covariance Selection via Alternating Linearization Methods. NIPS 2010: 2101-2109 - [c4]Katya Scheinberg, Irina Rish:
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach. ECML/PKDD (3) 2010: 196-212 - [i2]Katya Scheinberg, Shiqian Ma, Donald Goldfarb:
Sparse Inverse Covariance Selection via Alternating Linearization Methods. CoRR abs/1011.0097 (2010)
2000 – 2009
- 2009
- [b1]Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Introduction to Derivative-Free Optimization. MPS-SIAM series on optimization 8, SIAM 2009, ISBN 978-0-89871-668-9, pp. I-XII, 1-277 - [j11]Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points. SIAM J. Optim. 20(1): 387-415 (2009) - [c3]Narges Bani Asadi, Irina Rish, Katya Scheinberg, Dimitri Kanevsky, Bhuvana Ramabhadran:
Map approach to learning sparse Gaussian Markov networks. ICASSP 2009: 1721-1724 - [i1]Donald Goldfarb, Shiqian Ma, Katya Scheinberg:
Fast Alternating Linearization Methods for Minimizing the Sum of Two Convex Functions. CoRR abs/0912.4571 (2009) - 2008
- [j10]Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Geometry of interpolation sets in derivative free optimization. Math. Program. 111(1-2): 141-172 (2008) - [j9]Katya Scheinberg, Jiming Peng:
PREFACESpecial section on mathematical programming in data mining and machine learning. Optim. Methods Softw. 23(4): 473-474 (2008) - 2006
- [j8]Katya Scheinberg:
An Efficient Implementation of an Active Set Method for SVMs. J. Mach. Learn. Res. 7: 2237-2257 (2006) - [c2]Murray Campbell, Alexander Haubold, Shahram Ebadollahi, Dhiraj Joshi, Milind R. Naphade, Apostol Natsev, Joachim Seidl, John R. Smith, Katya Scheinberg, Jelena Tesic, Lexing Xie:
IBM Research TRECVID-2006 Video Retrieval System. TRECVID 2006 - 2005
- [j7]Donald Goldfarb, Katya Scheinberg:
Product-form Cholesky factorization in interior point methods for second-order cone programming. Math. Program. 103(1): 153-179 (2005) - 2004
- [j6]Donald Goldfarb, Katya Scheinberg:
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. Math. Program. 99(1): 1-34 (2004) - 2001
- [j5]Shai Fine, Katya Scheinberg:
Efficient SVM Training Using Low-Rank Kernel Representations. J. Mach. Learn. Res. 2: 243-264 (2001) - [c1]Shai Fine, Katya Scheinberg:
Incremental Learning and Selective Sampling via Parametric Optimization Framework for SVM. NIPS 2001: 705-711
1990 – 1999
- 1999
- [j4]Donald Goldfarb, R. Polyak, Katya Scheinberg, I. Yuzefovich:
A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization. Comput. Optim. Appl. 14(1): 55-74 (1999) - 1998
- [j3]Donald Goldfarb, Katya Scheinberg:
Interior Point Trajectories in Semidefinite Programming. SIAM J. Optim. 8(4): 871-886 (1998) - 1997
- [j2]Andrew R. Conn, Katya Scheinberg, Philippe L. Toint:
Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. 79: 397-414 (1997) - 1996
- [j1]Arkadii Nemirovskii, Katya Scheinberg:
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems. Math. Program. 72: 273-289 (1996)
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-13 00:41 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:
