English
Related papers

Related papers: Learning from Informants: Relations between Learni…

200 papers

In inductive inference, we investigate the learnability of classes of formal languages. We are interested in what classes of languages are learnable in certain learning settings. A class of languages is learnable, if there is a learner that…

Formal Languages and Automata Theory · Computer Science 2025-03-25 Niklas Mohrin

We consider training a binary classifier under delayed feedback (\emph{DF learning}). For example, in the conversion prediction in online ads, we initially receive negative samples that clicked the ads but did not buy an item; subsequently,…

Machine Learning · Computer Science 2022-06-13 Masahiro Kato , Shota Yasui

We try to establish a unified information theoretic approach to learning and to explore some of its applications. First, we define {\em predictive information} as the mutual information between the past and the future of a time series,…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Ilya Nemenman

For many interesting tasks, such as medical diagnosis and web page classification, a learner only has access to some positively labeled examples and many unlabeled examples. Learning from this type of data requires making assumptions about…

Machine Learning · Computer Science 2018-08-28 Jessa Bekker , Jesse Davis

Existing preference optimization methods often assume scenarios where paired preference feedback (preferred/positive vs. dis-preferred/negative examples) is available. This requirement limits their applicability in scenarios where only…

In order to model an efficient learning paradigm, iterative learning algorithms access data one by one, updating the current hypothesis without regress to past data. Past research on iterative learning analyzed for example many important…

Machine Learning · Computer Science 2021-04-29 Ardalan Khazraei , Timo Kötzing , Karen Seidel

Proper learning refers to the setting in which learners must emit predictors in the underlying hypothesis class $H$, and often leads to learners with simple algorithmic forms (e.g. empirical risk minimization (ERM), structural risk…

Machine Learning · Computer Science 2025-12-10 Julian Asilis , Siddartha Devic , Shaddin Dughmi , Vatsal Sharan , Shang-Hua Teng

We propose an interactive approach to language learning that utilizes linguistic acceptability judgments from an informant (a competent language user) to learn a grammar. Given a grammar formalism and a framework for synthesizing data, our…

Computation and Language · Computer Science 2024-05-09 Canaan Breiss , Alexis Ross , Amani Maina-Kilaas , Roger Levy , Jacob Andreas

Reinforcement Learning from Human Feedback (RLHF) aligns Large Language Models (LLMs) with human preferences, yet the underlying reward signals they internalize remain hidden, posing a critical challenge for interpretability and safety.…

Machine Learning · Computer Science 2026-01-21 Nyal Patel , Matthieu Bou , Arjun Jagota , Satyapriya Krishna , Sonali Parbhoo

We investigate learning collections of languages from texts by an inductive inference machine with access to the current datum and a bounded memory in form of states. Such a bounded memory states (BMS) learner is considered successful in…

Formal Languages and Automata Theory · Computer Science 2021-06-18 Timo Kötzing , Karen Seidel

This paper proposes a new approach to training recommender systems called deviation-based learning. The recommender and rational users have different knowledge. The recommender learns user knowledge by observing what action users take upon…

Theoretical Economics · Economics 2022-08-22 Junpei Komiyama , Shunya Noda

The performance of sentence encoders can be significantly improved through the simple practice of fine-tuning using contrastive loss. A natural question arises: what characteristics do models acquire during contrastive learning? This paper…

Computation and Language · Computer Science 2023-10-25 Hiroto Kurita , Goro Kobayashi , Sho Yokoi , Kentaro Inui

Learning from positive and unlabeled data or PU learning is the setting where a learner only has access to positive examples and unlabeled data. The assumption is that the unlabeled data can contain both positive and negative examples. This…

Machine Learning · Computer Science 2020-05-19 Jessa Bekker , Jesse Davis

In the classical herding model, asymptotic learning refers to situations where individuals eventually take the correct action regardless of their private information. Classical results identify classes of information structures for which…

Computer Science and Game Theory · Computer Science 2020-02-14 Itay Kavaler

Vocabulary learning by children can be characterized by many biases. When encountering a new word, children as well as adults, are biased towards assuming that it means something totally different from the words that they already know. To…

Computation and Language · Computer Science 2017-02-09 Ramon Ferrer-i-Cancho

Extensive research on formal verification of machine learning (ML) systems indicates that learning from data alone often fails to capture underlying background knowledge. A variety of verifiers have been developed to ensure that a…

Logic in Computer Science · Computer Science 2023-11-17 Thomas Flinkow , Barak A. Pearlmutter , Rosemary Monahan

We study learners (computable devices) inferring formal languages, a setting referred to as language learning in the limit or inductive inference. In particular, we require the learners we investigate to be witness-based, that is, to…

Machine Learning · Computer Science 2020-10-20 Vanja Doskoč , Timo Kötzing

Knowledge distillation has been widely adopted in a variety of tasks and has achieved remarkable successes. Since its inception, many researchers have been intrigued by the dark knowledge hidden in the outputs of the teacher model.…

Machine Learning · Computer Science 2023-02-17 Hua Yuan , Ning Xu , Yu Shi , Xin Geng , Yong Rui

We investigate how different learning restrictions reduce learning power and how the different restrictions relate to one another. We give a complete map for nine different restrictions both for the cases of complete information learning…

Machine Learning · Computer Science 2014-07-07 Timo Kötzing , Raphaela Palenta

Reward models (RMs) are essential in reinforcement learning from human feedback (RLHF) to align large language models (LLMs) with human values. However, RM training data is commonly recognized as low-quality, containing inductive biases…

Machine Learning · Computer Science 2026-05-20 Zhuo Li , Pengyu Cheng , Zhechao Yu , Feifei Tong , Anningzhe Gao , Tsung-Hui Chang , Xiang Wan , Erchao Zhao , Xiaoxi Jiang , Guanjun Jiang
‹ Prev 1 2 3 10 Next ›