Search Results for author:
Found 7 papers, 0 papers with code
Deep Lattice Networks and Partial Monotonic Functions
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 appropriate constraints for monotonicity, and jointly training the resulting network.
Monotonic Calibrated Interpolated Look-Up Tables
Real-world machine learning applications may require functions that are fast-to-evaluate and interpretable.
Diminishing Returns Shape Constraints for Interpretability and Regularization
We investigate machine learning models that can provide diminishing returns and accelerating returns guarantees to capture prior knowledge or policies about how outputs should depend on inputs.
Fast and Flexible Monotonic Functions with Ensembles of Lattices
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.
Launch and Iterate: Reducing Prediction Churn
Practical applications of machine learning often involve successive training iterations with changes to features and training examples.
Regularization Strategies for Quantile Regression
We show that minimizing an expected pinball loss over a continuous distribution of quantiles is a good regularizer even when only predicting a specific quantile.
Fast Linear Interpolation for Piecewise-Linear Functions, GAMs, and Deep Lattice Networks
We present fast implementations of linear interpolation operators for both piecewise linear functions and multi-dimensional look-up tables.
