paper-with-me

Papers

Diminishing Returns Shape Constraints for Interpretability and Regularization

2018-12-01 · NeurIPS 2018 12 · Maya Gupta, Dara Bahri, Andrew Cotter, Kevin Canini

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. We show that one can build flexible, nonlinear, multi-dimensional models using lattice functions with any combination of concavity/convexity and monotonicity constraints on any subsets of features, and compare to new shape-constrained neural networks. We demonstrate on real-world examples that these shape constrained models can provide tuning-free regularization and improve model understandability.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine Learning

Similar Papers 제목 키워드 기반

Maximizing Non-Monotone DR-Submodular Functions with Cardinality Constraints

2016-11-29 · Ali Khodabakhsh, Evdokia Nikolova

We consider the problem of maximizing a non-monotone DR-submodular function subject to a cardinality constraint. Diminishing returns (DR) submodularity is a generalization of the diminishing returns property for function…

BIG-bench Machine LearningCombinatorial Optimization

How Much is Enough? The Diminishing Returns of Tokenization Training Data

2025-02-27 · Varshini Reddy, Craig W. Schmidt, Yuval Pinter, Chris Tanner

Tokenization, a crucial initial step in natural language processing, is governed by several key parameters, such as the tokenization algorithm, vocabulary size, pre-tokenization strategy, inference strategy, and training…

Attribute

Limits of Difficulty Scaling: Hard Samples Yield Diminishing Returns in GRPO-Tuned SLMs

2026-04-07 · Suraj Yadav, Siddharth Yadav, Parth Goyal arxiv

Recent alignment work on Large Language Models (LLMs) suggests preference optimization can improve reasoning by shifting probability mass toward better solutions. We test this claim in a resource-constrained setting by a…

Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems

2019-06-30 · Omid Sadeghi, Reza Eghbali, Maryam Fazel

In this paper, we study a certain class of online optimization problems, where the goal is to maximize a function that is not necessarily concave and satisfies the Diminishing Returns (DR) property under budget constrain…

On the Diminishing Returns of Width for Continual Learning

2024-03-11 · Etash Guha, Vihan Lakshman

While deep neural networks have demonstrated groundbreaking performance in various settings, these models often suffer from \emph{catastrophic forgetting} when trained on new tasks in sequence. Several works have empiric…

Continual LearningLearning Theory