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.

Alexander Mangylov

dblp:163/2082 · also Oleksandr Mangylov · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 2

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.

Artificial intelligence
2 papers
Trustworthy machine learning · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.722020
Multidimensional Shape Constraints · ICML 2020
Monotonic Calibrated Interpolated Look-Up Tables · J. Mach. Learn. Res. 2016
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.412020
Multidimensional Shape Constraints · ICML 2020
Machine learning › Trustworthy machine learning
robustness
0.412020
Multidimensional Shape Constraints · ICML 2020
Machine learning › Trustworthy machine learning
shape constraints
0.412020
Multidimensional Shape Constraints · ICML 2020
Machine learning › Trustworthy machine learning
monotonicity
0.212016
Monotonic Calibrated Interpolated Look-Up Tables · J. Mach. Learn. Res. 2016

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

structural risk minimization · 0.5lattice model · 0.4generalized additive model · 0.4linear inequality constraints · 0.2linear inequality constraint · 0.2
YearPublicationVenuePosition
2020 Multidimensional Shape Constraints
abstract
We propose new multi-input shape constraints across four intuitive categories: complements, diminishers, dominance, and unimodality constraints. We show these shape constraints can be checked and even enforced when training machine-learned models for linear models, generalized additive models, and the nonlinear function class of multi-layer lattice models. Real-world experiments illustrate how the different shape constraints can be used to increase explainability and improve regularization, especially for non-IID train-test distribution shift.
Maya R. Gupta, Erez Louidor, Alexander Mangylov, Nobuyuki Morioka, Taman Narayan
ICML3
2016 Monotonic Calibrated Interpolated Look-Up Tables
abstract
Real-world machine learning applications may have requirements beyond accuracy, such as fast evaluation times and interpretability. In particular, guaranteed monotonicity of the learned function with respect to some of the inputs can be critical for user confidence. We propose meeting these goals for low-dimensional machine learning problems by learning flexible, monotonic functions using calibrated interpolated look-up tables. We extend the structural risk minimization framework of lattice regression to monotonic functions by adding linear inequality constraints. In addition, we propose jointly learning interpretable calibrations of each feature to normalize continuous features and handle categorical or missing data, at the cost of making the objective non-convex. We address large- scale learning through parallelization, mini-batching, and random sampling of additive regularizer terms. Case studies on real-world problems with up to sixteen features and up to hundreds of millions of training samples demonstrate the proposed monotonic functions can achieve state-of-the-art accuracy in practice while providing greater transparency to users.
Maya R. Gupta, Andrew Cotter, Jan Pfeifer, Konstantin Voevodski, Kevin Robert Canini, Alexander Mangylov, Wojtek Moczydlowski, Alexander Van Esbroeck
J. Mach. Learn. Res.6