Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Srikrishna Sridhar

dblp:122/4105 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-authorTheory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Mathematical optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › parallel algorithm design
asynchronous parallel algorithms
0.422015
An asynchronous parallel stochastic coordinate descent algorithm · J. Mach. Learn. Res. 2015
An Asynchronous Parallel Stochastic Coordinate Descent Algorithm · ICML 2014
Mathematical optimization › continuous optimization › convex optimization › first-order methods › coordinate descent
random coordinate descent
0.422015
An asynchronous parallel stochastic coordinate descent algorithm · J. Mach. Learn. Res. 2015
An Asynchronous Parallel Stochastic Coordinate Descent Algorithm · ICML 2014
Mathematical optimization
stochastic optimization
0.422015
An asynchronous parallel stochastic coordinate descent algorithm · J. Mach. Learn. Res. 2015
An Asynchronous Parallel Stochastic Coordinate Descent Algorithm · ICML 2014
Mathematical optimization
linear programming
0.212013
An Approximate, Efficient LP Solver for LP Rounding · NIPS 2013
Mathematical optimization › linear programming relaxation › rounding
LP rounding
0.212013
An Approximate, Efficient LP Solver for LP Rounding · NIPS 2013
Mathematical optimization › convex relaxation
quadratic programming relaxation
0.012013
An Approximate, Efficient LP Solver for LP Rounding · NIPS 2013

Methods — techniques the papers use, named apart from their topics

coordinate descent · 0.4linear convergence analysis · 0.4convex optimization · 0.4asynchronous updates · 0.2asynchronous update · 0.2stochastic coordinate descent · 0.2quadratic penalty formulation · 0.2perturbation analysis · 0.2
YearPublicationVenuePosition
2015 An asynchronous parallel stochastic coordinate descent algorithm
Ji Liu 0002, Stephen J. Wright 0001, Christopher Ré, Victor Bittorf, Srikrishna Sridhar
J. Mach. Learn. Res.5
2014 An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
abstract
We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably constrained functions. The method achieves a linear convergence rate on functions that satisfy an essential strong convexity property and a sublinear rate (1/K) on general convex functions. Near-linear speedup on a multicore system can be expected if the number of processors is O(n^1/2) in unconstrained optimization and O(n^1/4) in the separable-constrained case, where n is the number of variables. We describe results from implementation on 40-core processors.
Ji Liu 0002, Stephen J. Wright 0001, Christopher Ré, Victor Bittorf, Srikrishna Sridhar
ICML5
2014 Models and solution techniques for production planning problems with increasing byproducts
Srikrishna Sridhar, Jeff T. Linderoth, James R. Luedtke
J. Glob. Optim.1
2013 An Approximate, Efficient LP Solver for LP Rounding
abstract
Many problems in machine learning can be solved by rounding the solution of an appropriate linear program. We propose a scheme that is based on a quadratic program relaxation which allows us to use parallel stochastic-coordinate-descent to approximately solve large linear programs efficiently. Our software is an order of magnitude faster than Cplex (a commercial linear programming solver) and yields similar solution quality. Our results include a novel perturbation analysis of a quadratic-penalty formulation of linear programming and a convergence result, which we use to derive running time and quality guarantees.
Srikrishna Sridhar, Stephen J. Wright 0001, Christopher Ré, Ji Liu 0002, Victor Bittorf, Ce Zhang 0001
NIPS1
2012 Optimizing financial effects of HIE: a multi-party linear programming approach
abstract
OBJECTIVE: To describe an analytical framework for quantifying the societal savings and financial consequences of a health information exchange (HIE), and to demonstrate its use in designing pricing policies for sustainable HIEs. MATERIALS AND METHODS: We developed a linear programming model to (1) quantify the financial worth of HIE information to each of its participating institutions and (2) evaluate three HIE pricing policies: fixed-rate annual, charge per visit, and charge per look-up. We considered three desired outcomes of HIE-related emergency care (modeled as parameters): preventing unrequired hospitalizations, reducing duplicate tests, and avoiding emergency department (ED) visits. We applied this framework to 4639 ED encounters over a 12-month period in three large EDs in Milwaukee, Wisconsin, using Medicare/Medicaid claims data, public reports of hospital admissions, published payer mix data, and use data from a not-for-profit regional HIE. RESULTS: For this HIE, data accesses produced net financial gains for all providers and payers. Gains, due to HIE, were more significant for providers with more health maintenance organizations patients. Reducing unrequired hospitalizations and avoiding repeat ED visits were responsible for more than 70% of the savings. The results showed that fixed annual subscriptions can sustain this HIE, while ensuring financial gains to all participants. Sensitivity analysis revealed that the results were robust to uncertainties in modeling parameters. DISCUSSION: Our specific HIE pricing recommendations depend on the unique characteristics of this study population. However, our main contribution is the modeling approach, which is broadly applicable to other populations.
Srikrishna Sridhar, Patricia Flatley Brennan, Stephen J. Wright 0001, Stephen M. Robinson
J. Am. Medical Informatics Assoc.1