paper-with-me

Papers

The Self-Simplifying Machine: Exploiting the Structure of Piecewise Linear Neural Networks to Create Interpretable Models

2020-12-02 · William Knauth

Today, it is more important than ever before for users to have trust in the models they use. As Machine Learning models fall under increased regulatory scrutiny and begin to see more applications in high-stakes situations, it becomes critical to explain our models. Piecewise Linear Neural Networks (PLNN) with the ReLU activation function have quickly become extremely popular models due to many appealing properties; however, they still present many challenges in the areas of robustness and interpretation. To this end, we introduce novel methodology toward simplification and increased interpretability of Piecewise Linear Neural Networks for classification tasks. Our methods include the use of a trained, deep network to produce a well-performing, single-hidden-layer network without further stochastic training, in addition to an algorithm to reduce flat networks to a smaller, more interpretable size with minimal loss in performance. On these methods, we conduct preliminary studies of model performance, as well as a case study on Wells Fargo's Home Lending dataset, together with visual model interpretation.

📄 PDF Abstract BibTeX arXiv:2012.01293

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Interpretability 설명 없음
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…

Similar Papers 제목 키워드 기반

Unified Methods for Exploiting Piecewise Linear Structure in Convex Optimization

2016-12-01 · NeurIPS 2016 12 · Tyler B. Johnson, Carlos Guestrin

We develop methods for rapidly identifying important components of a convex optimization problem for the purpose of achieving fast convergence times. By considering a novel problem formulation—the minimization of a sum o…

A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems

2021-06-12 · Thuan Le Quang, Nam Phan Thanh, Simone Baldi

In this work, the issue of estimation of reachable sets in continuous bimodal piecewise affine systems is studied. A new method is proposed, in the framework of ellipsoidal bounding, using piecewise quadratic Lyapunov fu…

Simplifying Neural Networks During Training

2026-07-30 · Lorenzo Sciandra, Samuele Fonio, Roberto Esposito arxiv

Understanding and exploiting the training dynamics of overparameterized deep neural networks remains a central challenge in modern machine learning. Recent evidence on Neural Collapse (NC) shows that class representation…

Tailored neural networks for learning optimal value functions in MPC

2021-12-07 · Dieter Teichrib, Moritz Schulze Darup

Learning-based predictive control is a promising alternative to optimization-based MPC. However, efficiently learning the optimal control policy, the optimal value function, or the Q-function requires suitable function a…

A Fast, Principled Working Set Algorithm for Exploiting Piecewise Linear Structure in Convex Problems

2018-07-20 · Tyler B. Johnson, Carlos Guestrin

By reducing optimization to a sequence of smaller subproblems, working set algorithms achieve fast convergence times for many machine learning problems. Despite such performance, working set implementations often resort …