Search
Skip to Search Results- 29Greiner, Russell (Computing Science)
- 21Bowling, Michael (Computing Science)
- 14Schuurmans, Dale (Computing Science)
- 6Szepesvari, Csaba (Computing Science)
- 2White, Martha (Computing Science)
- 1Bellemare, Marc (Google Brain)
- 14Machine learning
- 13Machine Learning
- 9Reinforcement Learning
- 7Artificial Intelligence
- 3Game Theory
- 2Abstractions
-
Spring 2019
Forouzandehmoghadam, Amirhosein
A biomarker is a feature (e.g., gene expression, SNP, etc.) that is significantly different between two classes of instances – typically case and control. Knowing these biomarkers can help us understand a biological condition or identify the appropriate treatment for a certain disease. Many...
-
Assessing the Feasibility of Learning Biomedical Phenotype Patterns Using High-Throughput Omics Profiles
DownloadSpring 2014
A decade after the completion of the human genome project, the rapid advancement of the high-throughput measurement technologies has made omics (genomics, epigenomics, transcriptomics, metabolomics) profiling feasible. The availability of such omics profiles has raised the hope for the...
-
Fall 2013
Due to its wide application in various fields, clustering, as a fundamental unsupervised learning problem, has been intensively investigated over the past few decades. Unfortunately, standard clustering formulations are known to be computationally intractable. Although many convex relaxations of...
-
Building an expert-system based conversational agent to provide personalised resources about neurological disorders
DownloadSpring 2022
Researchers developing artificially intelligent conversational agents (aka, chat- bots) seek effective ways to provide personal assistance to users with various needs. We have implemented a web-based conversational agent that recom- mends resources to help clients (caregivers of patients...
-
Chasing Hallucinated Value: A Pitfall of Dyna Style Algorithms with Imperfect Environment Models
DownloadSpring 2020
In Dyna style algorithms, reinforcement learning (RL) agents use a model of the environment to generate simulated experience. By updating on this simulated experience, Dyna style algorithms allow agents to potentially learn control policies in fewer environment interactions than agents that use...
-
Spring 2016
One of the key obstacles to the effective use of mass spectrometry (MS) in high throughput metabolomics is the difficulty in interpreting measured spectra to accurately and efficiently identify metabolites. Traditional methods for automated metabolite identification compare the target MS spectrum...
-
Spring 2017
Most machine learning problems can be posed as solving a mathematical program that describes the structure of the prediction problem, usually expressed in terms of carefully chosen losses and regularizers. However, many machine learning problems yield mathematical programs that are not convex in...
-
Fall 2016
This thesis explores theoretical, computational, and practical aspects of convex (shape-constrained) regression, providing new excess risk upper bounds, a comparison of convex regression techniques with theoretical guarantee, a novel heuristic training algorithm for max-affine representations,...
-
Fall 2023
A survival dataset describes a collection of instances, such as patients, and associates each instance with either the time until an event (such as death), or the censoring time (eg, when the instance is lost to follow-up), which is a lower bound on the time until the event. While there are...
-
Fall 2022
As one of the main tasks in studying causality, the goal of Causal Inference is to determine "whether" (and perhaps "how much") the value of a certain variable (i.e., the effect) would change, had another specified variable (i.e., the cause) changed its value. A prominent example is the...