George D. Montañez

Orcid: 0000-0002-1333-4611

Affiliations:
  • Harvey Mudd College, Department of Computer Science, Claremont, CA, USA
  • Carnegie Mellon University, Pittsburgh, PA, USA (PhD)


According to our database1, George D. Montañez authored at least 35 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
From Targets to Rewards: Continuous Target Sets in the Algorithmic Search Framework.
Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023
Finite-Sample Bounds for Two-Distribution Hypothesis Tests.
Proceedings of the 10th IEEE International Conference on Data Science and Advanced Analytics, 2023

2022
Bounding Generalization Error Through Bias and Capacity.
Proceedings of the International Joint Conference on Neural Networks, 2022

Generating the Gopher's Grounds: Form, Function, Order, and Alignment.
Proceedings of the Agents and Artificial Intelligence - 14th International Conference, 2022

The Gopher Grounds: Testing the Link between Structure and Function in Simple Machines.
Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

Vectorization of Bias in Machine Learning Algorithms.
Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

Identifying Bias in Data Using Two-Distribution Hypothesis Tests.
Proceedings of the AIES '22: AAAI/ACM Conference on AI, Ethics, and Society, Oxford, United Kingdom, May 19, 2022

2021
Permutation Encoding for Text Steganography: A Short Tutorial.
CoRR, 2021

Undecidability of Underfitting in Learning Algorithms.
CoRR, 2021

Hyperparameter Choice as Search Bias in AlphaZero.
Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

The Label Recorder Method - Testing the Memorization Capacity of Machine Learning Models.
Proceedings of the Machine Learning, Optimization, and Data Science, 2021

The Gopher's Gambit: Survival Advantages of Artifact-based Intention Perception.
Proceedings of the 13th International Conference on Agents and Artificial Intelligence, 2021

A Probabilistic Theory of Abductive Reasoning.
Proceedings of the 13th International Conference on Agents and Artificial Intelligence, 2021

The Hero's Dilemma: Survival Advantages of Intention Perception in Virtual Agent Games.
Proceedings of the 2021 IEEE Conference on Games (CoG), 2021

The Predator's Purpose: Intention Perception in Simulated Agent Environments.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020
A Castro Consensus: Understanding the Role of Dependence in Consensus Formation.
Proceedings of the 2020 Truth and Trust Online Conference (TTO 2020), 2020

Limits of Transfer Learning.
Proceedings of the Machine Learning, Optimization, and Data Science, 2020

The Labeling Distribution Matrix (LDM): A Tool for Estimating Machine Learning Algorithm Capacity.
Proceedings of the 12th International Conference on Agents and Artificial Intelligence, 2020

Decomposable Probability-of-Success Metrics in Algorithmic Search.
Proceedings of the 12th International Conference on Agents and Artificial Intelligence, 2020

Trading Bias for Expressivity in Artificial Learning.
Proceedings of the Agents and Artificial Intelligence, 12th International Conference, 2020

The Bias-Expressivity Trade-off.
Proceedings of the 12th International Conference on Agents and Artificial Intelligence, 2020

Minimal Complexity Requirements for Proteins and Other Combinatorial Recognition Systems.
Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020), 2020

An Information-Theoretic Perspective on Overfitting and Underfitting.
Proceedings of the AI 2020: Advances in Artificial Intelligence, 2020

2019
The Futility of Bias-Free Learning and Search.
Proceedings of the AI 2019: Advances in Artificial Intelligence, 2019

2017
The famine of forte: Few search problems greatly favor your algorithm.
Proceedings of the 2017 IEEE International Conference on Systems, Man, and Cybernetics, 2017

Estimating the Prevalence of Religious Content in Intelligent Design Social Media.
Proceedings of the 2017 IEEE International Conference on Information Reuse and Integration, 2017

The LICORS cabinet: Nonparametric light cone methods for spatio-temporal modeling.
Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

2016
Why Machine Learning Works.
PhD thesis, 2016

Detecting Intelligence - The Turing Test and Other Design Detection Methodologies.
Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2016

2015
The LICORS Cabinet: Nonparametric Algorithms for Spatio-temporal Prediction.
CoRR, 2015

Inertial Hidden Markov Models: Modeling Change in Multivariate Time Series.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Cross-Device Search.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

2013
Bounding the number of favorable functions in stochastic search.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Information transmission through genetic algorithm fitness maps.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Assessing reliability of protein-protein interactions by gene ontology integration.
Proceedings of the 2012 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2012


  Loading...