Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Machine learning (2)
- Artificial Intelligence (1)
- Artificial intelligence (1)
- Bayesian Inference (1)
- Box embeddings (1)
-
- Causal Inference (1)
- Competence-Aware Autonomy (1)
- Competence-Modeling (1)
- Computerized adaptive testing (1)
- Data privacy (1)
- Decision-Making Under Uncertainty (1)
- Deep learning (1)
- Directed graphs (1)
- Embedding (1)
- Evaluation (1)
- Experimentation (1)
- Factorization (1)
- Federated learning (1)
- Geometric representation learning (1)
- Graph (1)
- Graph representation learning (1)
- Language models (1)
- Large language models (1)
- Learning with limited datasets (1)
- Machine Learning (1)
- Markov Decision Processes (1)
- Natural language processing (1)
- Network (1)
- Node (1)
- Performance Evaluation (1)
Articles 1 - 10 of 10
Full-Text Articles in Physical Sciences and Mathematics
Towards Robust Long-Form Text Generation Systems, Kalpesh Krishna
Towards Robust Long-Form Text Generation Systems, Kalpesh Krishna
Doctoral Dissertations
Text generation is an important emerging AI technology that has seen significant research advances in recent years. Due to its closeness to how humans communicate, mastering text generation technology can unlock several important applications such as intelligent chat-bots, creative writing assistance, or newer applications like task-agnostic few-shot learning. Most recently, the rapid scaling of large language models (LLMs) has resulted in systems like ChatGPT, capable of generating fluent, coherent and human-like text. However, despite their remarkable capabilities, LLMs still suffer from several limitations, particularly when generating long-form text. In particular, (1) long-form generated text is filled with factual inconsistencies to …
Quantifying And Enhancing The Security Of Federated Learning, Virat Vishnu Shejwalkar
Quantifying And Enhancing The Security Of Federated Learning, Virat Vishnu Shejwalkar
Doctoral Dissertations
Federated learning is an emerging distributed learning paradigm that allows multiple users to collaboratively train a joint machine learning model without having to share their private data with any third party. Due to many of its attractive properties, federated learning has received significant attention from academia as well as industry and now powers major applications, e.g., Google's Gboard and Assistant, Apple's Siri, Owkin's health diagnostics, etc. However, federated learning is yet to see widespread adoption due to a number of challenges. One such challenge is its susceptibility to poisoning by malicious users who aim to manipulate the joint machine learning …
Learning To See With Minimal Human Supervision, Zezhou Cheng
Learning To See With Minimal Human Supervision, Zezhou Cheng
Doctoral Dissertations
Deep learning has significantly advanced computer vision in the past decade, paving the way for practical applications such as facial recognition and autonomous driving. However, current techniques depend heavily on human supervision, limiting their broader deployment. This dissertation tackles this problem by introducing algorithms and theories to minimize human supervision in three key areas: data, annotations, and neural network architectures, in the context of various visual understanding tasks such as object detection, image restoration, and 3D generation. First, we present self-supervised learning algorithms to handle in-the-wild images and videos that traditionally require time-consuming manual curation and labeling. We demonstrate that …
Foundations Of Node Representation Learning, Sudhanshu Chanpuriya
Foundations Of Node Representation Learning, Sudhanshu Chanpuriya
Doctoral Dissertations
Low-dimensional node representations, also called node embeddings, are a cornerstone in the modeling and analysis of complex networks. In recent years, advances in deep learning have spurred development of novel neural network-inspired methods for learning node representations which have largely surpassed classical 'spectral' embeddings in performance. Yet little work asks the central questions of this thesis: Why do these novel deep methods outperform their classical predecessors, and what are their limitations? We pursue several paths to answering these questions. To further our understanding of deep embedding methods, we explore their relationship with spectral methods, which are better understood, and show …
Bayesian Structural Causal Inference With Probabilistic Programming, Sam A. Witty
Bayesian Structural Causal Inference With Probabilistic Programming, Sam A. Witty
Doctoral Dissertations
Reasoning about causal relationships is central to the human experience. This evokes a natural question in our pursuit of human-like artificial intelligence: how might we imbue intelligent systems with similar causal reasoning capabilities? Better yet, how might we imbue intelligent systems with the ability to learn cause and effect relationships from observation and experimentation? Unfortunately, reasoning about cause and effect requires more than just data: it also requires partial knowledge about data generating mechanisms. Given this need, our task then as computational scientists is to design data structures for representing partial causal knowledge, and algorithms for updating that knowledge in …
Effective And Efficient Transfer Learning In The Era Of Large Language Models, Tu Vu
Effective And Efficient Transfer Learning In The Era Of Large Language Models, Tu Vu
Doctoral Dissertations
Substantial progress has been made in the field of natural language processing (NLP) due to the advent of large language models (LLMs)—deep neural networks with millions or billions of parameters pre-trained on large amounts of unlabeled data. However, these models have common weaknesses, including degenerate performance in data-scarce scenarios, and substantial computational resource requirements. This thesis aims to develop methods to address these limitations for improved applicability and performance of LLMs in resource-constrained settings with limited data and/or computational resources. To address the need for labeled data in data-scarce scenarios, I present two methods, in Chapter 2 and Chapter 3, …
Graph Representation Learning With Box Embeddings, Dongxu Zhang
Graph Representation Learning With Box Embeddings, Dongxu Zhang
Doctoral Dissertations
Graphs are ubiquitous data structures, present in many machine-learning tasks, such as link prediction of products and node classification of scientific papers. As gradient descent drives the training of most modern machine learning architectures, the ability to encode graph-structured data using a differentiable representation is essential to make use of this data. Most approaches encode graph structure in Euclidean space, however, it is non-trivial to model directed edges. The naive solution is to represent each node using a separate "source" and "target" vector, however, this can decouple the representation, making it harder for the model to capture information within longer …
An Introspective Approach For Competence-Aware Autonomy, Connor Basich
An Introspective Approach For Competence-Aware Autonomy, Connor Basich
Doctoral Dissertations
Building and deploying autonomous systems in the open world has long been a goal of both the artificial intelligence (AI) and robotics communities. From autonomous driving, to health care, to office assistance, these systems have the potential to transform society and alter our everyday lives. The open world, however, presents numerous challenges that question the typical assumptions made by the models and frameworks often used in contemporary AI and robotics. Systems in the open world are faced with an unconstrained and non-stationary environment with a range of heterogeneous actors that is too complex to be modeled in its entirety. Moreover, …
Rigorous Experimentation For Reinforcement Learning, Scott M. Jordan
Rigorous Experimentation For Reinforcement Learning, Scott M. Jordan
Doctoral Dissertations
Scientific fields make advancements by leveraging the knowledge created by others to push the boundary of understanding. The primary tool in many fields for generating knowledge is empirical experimentation. Although common, generating accurate knowledge from empirical experiments is often challenging due to inherent randomness in execution and confounding variables that can obscure the correct interpretation of the results. As such, researchers must hold themselves and others to a high degree of rigor when designing experiments. Unfortunately, most reinforcement learning (RL) experiments lack this rigor, making the knowledge generated from experiments dubious. This dissertation proposes methods to address central issues in …
Learning From Sequential User Data: Models And Sample-Efficient Algorithms, Aritra Ghosh
Learning From Sequential User Data: Models And Sample-Efficient Algorithms, Aritra Ghosh
Doctoral Dissertations
Recent advances in deep learning have made learning representation from ever-growing datasets possible in the domain of vision, natural language processing (NLP), and robotics, among others. However, deep networks are notoriously data-hungry; for example, training language models with attention mechanisms sometimes requires trillions of parameters and tokens. In contrast, we can often access a limited number of samples in many tasks. It is crucial to learn models from these `limited' datasets. Learning with limited datasets can take several forms. In this thesis, we study how to select data samples sequentially such that downstream task performance is maximized. Moreover, we study …