activity
20192021
collaborators

8 papers

cs.CR2021

Permutation Encoding for Text Steganography: A Short Tutorial

George D. Montanez

We explore a method of encoding secret messages using factoradic numbering of permuted lists of text or numeric elements. Encoding and decoding methods are provided, with code, and…

cs.LG2021

Undecidability of Underfitting in Learning Algorithms

Sonia Sehra, David Flores, George D. Montanez

Using recent machine learning results that present an information-theoretic perspective on underfitting and overfitting, we prove that deciding whether an encodable learning algori…

cs.LG2020

An Information-Theoretic Perspective on Overfitting and Underfitting

Daniel Bashir, George D. Montanez, Sonia Sehra +2

We present an information-theoretic framework for understanding overfitting and underfitting in machine learning and prove the formal undecidability of determining whether an arbit…

stat.ML2020

Limits of Transfer Learning

Jake Williams, Abel Tadesse, Tyler Sam +2

Transfer learning involves taking information and insight from one problem domain and applying it to a new problem domain. Although widely used in practice, theory for transfer lea…

cs.LG2020

The Labeling Distribution Matrix (LDM): A Tool for Estimating Machine Learning Algorithm Capacity

Pedro Sandoval Segura, Julius Lauw, Daniel Bashir +4

Algorithm performance in supervised learning is a combination of memorization, generalization, and luck. By estimating how much information an algorithm can memorize from a dataset…

stat.ML2020

Decomposable Probability-of-Success Metrics in Algorithmic Search

Tyler Sam, Jake Williams, Abel Tadesse +2

Previous studies have used a specific success metric within an algorithmic search framework to prove machine learning impossibility results. However, this specific success metric p…