8,614 research outputs found

    UMSL Bulletin 2023-2024

    Get PDF
    The 2023-2024 Bulletin and Course Catalog for the University of Missouri St. Louis.https://irl.umsl.edu/bulletin/1088/thumbnail.jp

    Reinforcement learning in large state action spaces

    Get PDF
    Reinforcement learning (RL) is a promising framework for training intelligent agents which learn to optimize long term utility by directly interacting with the environment. Creating RL methods which scale to large state-action spaces is a critical problem towards ensuring real world deployment of RL systems. However, several challenges limit the applicability of RL to large scale settings. These include difficulties with exploration, low sample efficiency, computational intractability, task constraints like decentralization and lack of guarantees about important properties like performance, generalization and robustness in potentially unseen scenarios. This thesis is motivated towards bridging the aforementioned gap. We propose several principled algorithms and frameworks for studying and addressing the above challenges RL. The proposed methods cover a wide range of RL settings (single and multi-agent systems (MAS) with all the variations in the latter, prediction and control, model-based and model-free methods, value-based and policy-based methods). In this work we propose the first results on several different problems: e.g. tensorization of the Bellman equation which allows exponential sample efficiency gains (Chapter 4), provable suboptimality arising from structural constraints in MAS(Chapter 3), combinatorial generalization results in cooperative MAS(Chapter 5), generalization results on observation shifts(Chapter 7), learning deterministic policies in a probabilistic RL framework(Chapter 6). Our algorithms exhibit provably enhanced performance and sample efficiency along with better scalability. Additionally, we also shed light on generalization aspects of the agents under different frameworks. These properties have been been driven by the use of several advanced tools (e.g. statistical machine learning, state abstraction, variational inference, tensor theory). In summary, the contributions in this thesis significantly advance progress towards making RL agents ready for large scale, real world applications

    Machine learning approach towards predicting turbulent fluid flow using convolutional neural networks

    Get PDF
    Using convolutional neural networks, we present a novel method for predicting turbulent fluid flow through an array of obstacles in this thesis. In recent years, machine learning has exploded in popularity due to its ability to create accurate data driven models and the abundance of available data. In an attempt to understand the characteristics of turbulent fluid flow, we utilise a novel convolutional autoencoder neural network to predict the first ten POD modes of turbulent fluid flow. We find that the model is able to predict the first two POD modes well although and with less accuracy for the remaining eight POD modes. In addition, we find that the ML-predicted POD modes are accurate enough to be used to reconstruct turbulent flow that adequately captures the large-scale details of the original simulation

    Colloquium: Quantum and Classical Discrete Time Crystals

    Full text link
    The spontaneous breaking of time translation symmetry has led to the discovery of a new phase of matter - the discrete time crystal. Discrete time crystals exhibit rigid subharmonic oscillations, which result from a combination of many-body interactions, collective synchronization, and ergodicity breaking. This Colloquium reviews recent theoretical and experimental advances in the study of quantum and classical discrete time crystals. We focus on the breaking of ergodicity as the key to discrete time crystals and the delaying of ergodicity as the source of numerous phenomena that share many of the properties of discrete time crystals, including the AC Josephson effect, coupled map lattices, and Faraday waves. Theoretically, there exists a diverse array of strategies to stabilize time crystalline order in both closed and open systems, ranging from localization and prethermalization to dissipation and error correction. Experimentally, many-body quantum simulators provide a natural platform for investigating signatures of time crystalline order; recent work utilizing trapped ions, solid-state spin systems, and superconducting qubits will be reviewed. Finally, this Colloquium concludes by describing outstanding challenges in the field and a vision for new directions on both the experimental and theoretical fronts.Comment: 29 pages, 13 figures; commissioned review for Reviews of Modern Physic

    2023-2024 Boise State University Undergraduate Catalog

    Get PDF
    This catalog is primarily for and directed at students. However, it serves many audiences, such as high school counselors, academic advisors, and the public. In this catalog you will find an overview of Boise State University and information on admission, registration, grades, tuition and fees, financial aid, housing, student services, and other important policies and procedures. However, most of this catalog is devoted to describing the various programs and courses offered at Boise State

    More Than Machines?

    Get PDF
    We know that robots are just machines. Why then do we often talk about them as if they were alive? Laura Voss explores this fascinating phenomenon, providing a rich insight into practices of animacy (and inanimacy) attribution to robot technology: from science-fiction to robotics R&D, from science communication to media discourse, and from the theoretical perspectives of STS to the cognitive sciences. Taking an interdisciplinary perspective, and backed by a wealth of empirical material, Voss shows how scientists, engineers, journalists - and everyone else - can face the challenge of robot technology appearing »a little bit alive« with a reflexive and yet pragmatic stance

    Land Use and Land Cover Mapping in a Changing World

    Get PDF
    It is increasingly being recognized that land use and land cover changes driven by anthropogenic pressures are impacting terrestrial and aquatic ecosystems and their services, human society, and human livelihoods and well-being. This Special Issue contains 12 original papers covering various issues related to land use and land use changes in various parts of the world (see references), with the purpose of providing a forum to exchange ideas and progress in related areas. Research topics include land use targets, dynamic modelling and mapping using satellite images, pressures from energy production, deforestation, impacts on ecosystem services, aboveground biomass evaluation, and investigations on libraries of legends and classification systems

    Data Tiling for Sparse Computation

    Get PDF
    Many real-world data contain internal relationships. Efficient analysis of these relationship data is crucial for important problems including genome alignment, network vulnerability analysis, ranking web pages, among others. Such relationship data is frequently sparse and analysis on it is called sparse computation. We demonstrate that the important technique of data tiling is more powerful than previously known by broadening its application space. We focus on three important sparse computation areas: graph analysis, linear algebra, and bioinformatics. We demonstrate data tiling's power by addressing key issues and providing significant improvements---to both runtime and solution quality---in each area. For graph analysis, we focus on fast data tiling techniques that can produce well-structured tiles and demonstrate theoretical hardness results. These tiles are suitable for graph problems as they reduce data movement and ultimately improve end-to-end runtime performance. For linear algebra, we introduce a new cache-aware tiling technique and apply it to the key kernel of sparse matrix by sparse matrix multiplication. This technique tiles the second input matrix and then uses a small, summary matrix to guide access to the tiles during computation. Our approach results in the fastest known implementation across three distinct CPU architectures. In bioinformatics, we develop a tiling based de novo genome assembly pipeline. We start with reads and develop either a graph or hypergraph that captures internal relationships between reads. This is then tiled to minimize connections while maintaining balance. We then treat each resulting tile independently as the input to an existing, shared-memory assembler. Our pipeline improves existing state-of-the-art de novo genome assemblers and brings both runtime and quality improvements to them on both real-world and simulated datasets.Ph.D

    The Importance of Quantum Information in the Stock Market and Financial Decision Making in Conditions of Radical Uncertainty

    Get PDF
    The Universe is a coin that’s already been flipped, heads or tails predetermined: all we’re doing is uncovering it the ‘paradox’ is only a conflict between reality and your feeling of what reality ‘ought to be’.Richard FeynmanThe aim of the research takes place through two parallel directions. The first is gaining an understanding of the applicability of quantum mechanics/quantum physics to human decision-making processes in the stock market with quantum information as a decision-making lever, and the second direction is neuroscience and artificial intelligence using postulates analogous to the postulates of quantum mechanics and radical uncertainty in conditions of radical uncertainty.The world of radical uncertainty (radical uncertainty is based on the knowledge of quantum mechanics from the claim that there is no causal certainty). it is everywhere in our world. "Radical uncertainty is characterized by vagueness, ignorance, indeterminacy, ambiguity and lack of information. He prefers to create 'mysteries' rather than 'puzzles' with defined solutions. Mysteries are ill-defined problems in which action is required, but the future is uncertain, the consequences unpredictable, and disagreement inevitable. "How should we make decisions in these circumstances?" (J. Kay and M. King, 2020), while "uncertainty and ambiguity are at the very core of the stock market. "Narratives are the currency of uncertainty" (N. Mangee, 2022)

    Towards provably efficient quantum algorithms for large-scale machine-learning models

    Full text link
    Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as O(T2×polylog(n))\mathcal{O}(T^2 \times \text{polylog}(n)), where nn is the size of the models and TT is the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems.Comment: 7+30 pages, 3+5 figure
    corecore