paper-with-me

홈 › Papers

Fast and Flexible Monotonic Functions with Ensembles of Lattices

2016-12-01 · NeurIPS 2016 12 · Mahdi Milani Fard, Kevin Canini, Andrew Cotter, Jan Pfeifer, Maya Gupta

For many machine learning problems, there are some inputs that are known to be positively (or negatively) related to the output, and in such cases training the model to respect that monotonic relationship can provide regularization, and makes the model more interpretable. However, flexible monotonic functions are computationally challenging to learn beyond a few features. We break through this barrier by learning ensembles of monotonic calibrated interpolated look-up tables (lattices). A key contribution is an automated algorithm for selecting feature subsets for the ensemble base models. We demonstrate that compared to random forests, these ensembles produce similar or better accuracy, while providing guaranteed monotonicity consistent with prior knowledge, smaller model size and faster evaluation.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Deep Lattice Networks and Partial Monotonic Functions

2017-09-19 · NeurIPS 2017 12 · Seungil You, David Ding, Kevin Canini, Jan Pfeifer 외

We propose learning deep models that are monotonic with respect to a user-specified set of inputs by alternating layers of linear embeddings, ensembles of lattices, and calibrators (piecewise linear functions), with appr…

General Classificationregression

Monotonic Kronecker-Factored Lattice

2021-01-01 · ICLR 2021 1 · William Taylor Bakst, Nobuyuki Morioka, Erez Louidor

It is computationally challenging to learn flexible monotonic functions that guarantee model behavior and provide interpretability beyond a few input features, and in a time where minimizing resource use is increasingly …

Monotonic Calibrated Interpolated Look-Up Tables

2015-05-23 · Maya Gupta, Andrew Cotter, Jan Pfeifer, Konstantin Voevodski 외

Real-world machine learning applications may require functions that are fast-to-evaluate and interpretable. In particular, guaranteed monotonicity of the learned function can be critical to user trust. We propose meeting…

BIG-bench Machine Learning

Data Compression using Rank-1 Lattices for Parameter Estimation in Machine Learning

2024-09-20 · Michael Gnewuch, Kumar Harsha, Marcin Wnuk

The mean squared error and regularized versions of it are standard loss functions in supervised machine learning. However, calculating these losses for large data sets can be computationally demanding. Modifying an appro…

Data Compressionparameter estimation

Flexible Modeling and Multitask Learning using Differentiable Tree Ensembles

2022-05-19 · Shibal Ibrahim, Hussein Hazimeh, Rahul Mazumder

Decision tree ensembles are widely used and competitive learning models. Despite their success, popular toolkits for learning tree ensembles have limited modeling capabilities. For instance, these toolkits support a limi…

Multi-Task Learning