Society's newfound dependence on wireless transmission systems has driven demand for access to the electromagnetic (EM) spectrum to an all-time high. In particular, wireless applications related to the fifth generation (5G) of cellular technology along with statically allocated radar systems have contributed to the increasing scarcity of the sub 6 GHz frequency bands. As a result, development of Dynamic Spectrum Access (DSA) techniques for sharing these frequencies has become a critical research area for the greater wireless community. Since among incumbent systems, radars are the largest consumers of spectrum in the sub 6 GHz regime, and are being used increasingly for civilian applications such as traffic control, adaptive cruise control, and collision avoidance, the need for radars which can adaptively tune specific transmission parameters in an intelligent manner to promote coexistence with other systems has arisen. Thus, fully-aware, dynamic, cognitive radar has been proposed as target for radars to evolve towards. In this thesis, we extend current research thrusts towards cognitive radar to utilize Reinforcement Learning (RL) techniques which allow a radar system to learn desired behavior using information obtained from past transmissions. Since radar systems inherently interact with their electromagnetic environment, it is natural to view the use of reinforcement learning techniques as a straightforward extension to previous adaptive techniques. However, in designing learning algorithms for radar systems, we must carefully define goal-driven rewards, formalize the learning process, and consider an appropriate amount of environmental information. In this thesis, we apply well-established and emerging reinforcement learning approaches to meet the demands of modern radar coexistence problems. In particular, function estimation using deep neural networks is examined, as Deep RL presents a scalable learning framework which allows many environmental states to be considered in the decision-making process. We then show how these techniques can be used to improve traditional radar performance metrics, such as interference avoidance, spectral efficiency, and target detectibility with simulated and experimental results. We also compare the learning techniques to each other and naive approaches, such as fixed bandwidth radar and avoiding interference reactively. Finally, online learning strategies are considered which aim to balance the fundamental learning trade-off between exploration and exploitation. We show that online learning techniques can be used to select individual waveforms or applied as a high-level controller in a hierarchical learning scheme based on the biologically inspired concept of metacognition. The general use of RL techniques provides a robust framework for decision making under uncertainty that is more flexible than previously proposed cognitive radar strategies. Further, the wide array of RL models and algorithms allow the underlying structure to be applied to both small and large-scale radar scenarios. / Master of Science / Society's newfound dependence on wireless transmission systems has driven demand for control of the electromagnetic (EM) spectrum to an all-time high. In particular, federal spectrum auctions and the fifth generation of wireless technologies have contributed to the scarcity of frequency bands below 6GHz. These frequencies are widely used by both radar and communications systems due to favorable propagation characteristics. However, current radar systems typically occupy a fixed bandwidth and are tend to be poorly equipped to share their allocated spectrum with other users, which has become a necessity given the growth of wireless traffic. In this thesis, we study learning algorithms which enable a radar to optimize its electromagnetic pulses based on feedback from received signals. In particular, we are interested in reinforcement learning algorithms which allow a radar to learn optimal behavior based on rewards defined by a human. Using these algorithms, radar system designers can choose which metrics may be most important for a given radar application which can then be optimized for the given setting. However, scaling reinforcement learning to real-world problems such as radar optimization is often difficult due to the massive scope of the problem. Here we attempt to identify potential issues with implementation of each algorithm and narrow in on algorithms that are well-suited for real-time radar operation.

Cyber-Physical Systems represent a critical intersection of physical infrastructure and digital technologies. Ensuring the safety and reliability of these interconnected systems is vital for mitigating risks and enhancing overall system safety. In recent decades, the transportation domain has seen significant adoption of cyber-physical systems, such as automated vehicles. This dissertation will focus on the application of cyber-physical systems in transportation. Statistical learning techniques offer a powerful approach to analyzing complex transportation data, providing insights that enhance safety measures and operational efficiencies. This dissertation underscores the pivotal role of statistical learning in advancing safety within cyber physical transportation systems. By harnessing the power of data-driven insights, predictive modeling, and advanced analytics, this research contributes to the development of smarter, safer, and more resilient transportation systems. Chapter 2 proposes a novel stochastic jump-based model to capture the driving dynamics of safety-critical events. The identification of such events is challenging due to their complex nature and the high frequency kinematic data generated by modern data acquisition systems. This chapter addresses these challenges by developing a model that effectively represents the stochastic nature of driving behaviors and assume the happening of a jump process will lead to safety-critical situations. To tackle the issue of rarity in crash data, Chapter 3 introduces a variational inference of extremes approach based on a generalized additive neural network. This method leverages statistical learning to infer the distribution of extreme events, allowing for better generalization ability to unseen data despite the limited availability of crash events. By focusing on extreme value theory, this chapter enhances statistical learning's ability to predict and understand rare but high-impact events. Chapter 4 shifts focus to the safety validation of cyber-physical transportation systems, requiring a unique approach due to their advanced and complex nature. This chapter proposes a kernel-based method that simultaneously satisfies representativeness and criticality for safety verification. This method ensures that the safety evaluation process covers a wide range of scenarios while focusing on those most likely to lead to critical outcomes. In Chapter 5, a deep generative model is proposed to identify the boundary of safety-critical events. This model uses the encoder component to reduce high-dimensional input data into lower-dimensional latent representations, which are then utilized to generate new driving scenarios and predict their associated risks. The decoder component reconstructs the original high-dimensional case parameters, allowing for a comprehensive understanding of the factors contributing to safety-critical events. The chapter also introduces an adversarial perturbation approach to efficiently determine the boundary of risk, significantly reducing computational time while maintaining precision. Overall, this dissertation demonstrates the potential of using advanced statistical learning methods to enhance the safety and reliability of cyber-physical transportation systems. By developing innovative models and methodologies, this dissertation provides valuable tools and theoretical foundations for risk prediction, safety validation, and proactive management of transportation systems in an increasingly digital and interconnected world. / Doctor of Philosophy / Transportation is the foundation for modern society, cyber-physical systems are reshaping the future for automotive industry, holding a huge potential to make the transportation much safer and more efficient. Cyber-physical transportation systems are still in the phase of rapid development, ensuring the safety and reliability of these systems is crucial for its wide application. However, how to ensure safety for cyber-Physical Transportation System is still an open challenge. Statistical learning techniques offer a powerful way to analyze transportation data, providing insights that enhance safety. By leveraging data-driven insights, predictive modeling, and advanced analytics, this dissertation contributes to developing smarter, safer, and more resilient transportation systems. For better describing and identifying safety critical events, this dissertation propose a novel stochastic jump-based model helping to capture the dynamics of safety-critical events, a Variational Inference of Extremes approach to tackles the issue of limited crash data. Beside safety evaluation, a notable challenge for ensuring the safety of cyber-physical transportation system goes to how to test and develop robust control systems. To this end, Chapter 4 focuses on the safety validation of automated vehicles, proposing a kernel-based method that ensures both representativeness and criticality in safety verification. This approach covers a wide range of scenarios while concentrating on those most likely to lead to critical outcomes. Following the sampled cases, Chapter 5 proposes a data driven approach to identify the operational boundaries of safety-critical events. Overall, this dissertation demonstrates the potential of statistical learning to enhance transportation safety and reliability.

We present distribution independent bounds on the generalization misclassification performance of a family of kernel classifiers with margin. Support Vector Machine classifiers (SVM) stem out of this class of machines. The bounds are derived through computations of the $V_gamma$ dimension of a family of loss functions where the SVM one belongs to. Bounds that use functions of margin distributions (i.e. functions of the slack variables of SVM) are derived.

Statistical learning (SL) is believed to be a mechanism that enables successful language acquisition. Language acquisition in turn is heavily influenced by environmental factors such as socioeconomic status (SES). However, it is unknown to what extent SL abilities interact with SES in affecting language outcomes. To examine this potential interaction, we measured event-related potentials (ERPs) in 38 children aged 7-12 while performing a visual SL task consisting of a sequence of stimuli that contained covert statistical probabilities that predicted a target stimulus. Hierarchical regression results indicated that SL ability moderated the relationship between SES (average of both caregiver’s education level) and language scores (grammar, and marginally with receptive vocabulary). For children with high SL ability, SES had a weaker effect on language compared to children with low SL ability, suggesting that having good SL abilities could help ameliorate the disadvantages associated with being raised in a family with lower SES.

In 1998, it was proved by Ben-David and Litman that a concept space has a sample compression scheme of size $d$ if and only if every finite subspace has a sample compression scheme of size $d$. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same time measurability of the hypotheses is a necessary condition for learnability. In this thesis we discuss when a sample compression scheme, created from compression schemes on finite subspaces via the compactness theorem, have measurable hypotheses. We show that if $X$ is a standard Borel space with a $d$-maximum and universally separable concept class $\m{C}$, then $(X,\CC)$ has a sample compression scheme of size $d$ with universally Borel measurable hypotheses. Additionally we introduce a new variant of compression scheme called a copy sample compression scheme.

Five experiments explored how we learn to read and recognise words with typical and atypical spelling-sound mappings and to generalize to novel words. In Experiment 1, adults learned to read pseudowords with typical or atypical pronunciations. There was some evidence that prior exposure to word meanings enhanced orthographic learning. However, interpretation was clouded by stimulus control problems that plague research using natural alphabets. In Experiment 2, an artificial orthography paradigm was developed to overcome these problems. Adults learned to read novel words written in novel symbols. Post-training, they could generalize, indicating extraction of individual symbol sounds. The frequency and predictability of symbol-sound mappings influenced learning and generalization, mirroring natural language findings. Experiment 3 found extended training to improve item recognition and generalization. In Experiment 4, pre-exposure to item sounds plus an object referent vs. item sounds provided equivalent benefit for orthographic learning. By the end of training, this was limited to items with low frequency unpredictable symbol-sound mappings. In Experiment 5, pre-exposure to novel definitions enhanced orthographic learning more than pre-exposure to item sounds, but by the end of training, both conditions were again equally beneficial.

Package party, implemented in the R system for statistical computing, provides basic classes and methods for recursive partitioning along with reference implementations for three recently-suggested tree-based learners: conditional inference trees and forests, and model-based recursive partitioning. / Series: Research Report Series / Department of Statistics and Mathematics

L'Apprentissage Automatique tire ses racines d'un large champ disciplinaire qui inclut l'Intelligence Artificielle, la Reconnaissance de Formes, les Statistiques ou l'Optimisation. Dès les origines de l'Apprentissage, les questions computationelles et les propriétés en généralisation ont toutes deux été identifiées comme centrales pour la discipline. Tandis que les premières concernent les questions de calculabilité ou de complexité (sur un plan fondamental) ou d'efficacité computationelle (d'un point de vue plus pratique) des systèmes d'apprentissage, les secondes visent a comprendre et caractériser comment les solutions qu'elles fournissent vont se comporter sur de nouvelles données non encore vues. Ces dernières années, l'émergence de jeux de données à grande échelle en Apprentissage Automatique a profondément remanié les principes de la Théorie de l'Apprentissage. En prenant en compte de potentielles contraintes sur le temps d'entraînement, il faut faire face à un compromis plus complexe que ceux qui sont classiquement traités par les Statistiques. Une conséquence directe tient en ce que la mise en place d'algorithmes efficaces (autant en théorie qu'en pratique) capables de tourner sur des jeux de données a grande échelle doivent impérativement prendre en compte les aspects statistiques et computationels de l'Apprentissage de façon conjointe. Cette thèse a pour but de mettre à jour, analyser et exploiter certaines des connections qui existent naturellement entre les aspects statistiques et computationels de l'Apprentissage. / Machine Learning is known to have its roots in a broad spectrum of fields including Artificial Intelligence, Pattern Recognition, Statistics or Optimisation. From the earliest stages of Machine Learning, both computational issues and generalisation properties have been identified as central to the field. While the former address the question of computability, complexity (from a fundamental perspective) or computational efficiency (on a more practical standpoint) of learning systems, the latter aim at understanding and characterising how well the solutions they provide perform on new, unseen data. Those last years, the emergence of large-scale datasets in Machine Learning has been deeply reshaping the principles of Learning Theory. Taking into account possible constraints on the training time, one has to deal with more complex trade-offs than the ones classically addressed by Statistics. As a direct consequence, designing new efficient algorithms (both in theory and practice), able to handle large-scale datasets, imposes to jointly deal with the statistical and computational aspects of Learning. The present thesis aims at unravelling, analysing and exploiting some of the connections that naturally exist between the statistical and computational aspects of Learning. More precisely, in a first part, we extend the stability analysis, which relates some algorithmic properties to the generalisation abilities of learning algorithms, to a novel (and fine-grain) performance measure, namely the confusion matrix. In a second part, we present a novel approach to learn a kernel-based regression function, that serves the learning task at hand and exploits the structure of

<p>This paper explores the effect of credit rating agency’s (CRA) reputation on the discretionary disclosures of corporate bond issuers. Academics, practitioners, and regulators disagree on the informational role played by major CRAs and the usefulness of credit ratings in influencing investors’ perception of the credit risk of bond issuers. Using management earnings forecasts as a measure of discretionary disclosure, I find that investors demand more (less) disclosure from bond issuers when the ratings become less (more) credible. In addition, using content analytics, I find that bond issuers disclose more qualitative information during periods of low CRA reputation to aid investors better assess credit risk. That the corporate managers alter their voluntary disclosure in response to CRA reputation shocks is consistent with credit ratings providing incremental information to investors and reducing adverse selection in lending markets. Overall, my findings suggest that managers rely on voluntary disclosure as a credible mechanism to reduce information asymmetry in bond markets.</p> / Dissertation

Climate change has emerged as one of the most critical issues of the 21st century. It stands to impact communities across the globe, forcing individuals and governments alike to adapt to a new environment. While it is critical for governments and organizations to make strides to change business as usual, individuals also have the ability to make an impact. The goal of this thesis is to study the beliefs that shape climate-related attitudes and the factors that drive the adoption of sustainable practices and technologies using a foundation in statistical learning. Previous research has studied the factors that influence both climate-related attitude and adoption, but comparatively little has been done to leverage recent advances in statistical learning and computing ability to advance our understanding of these topics. As increasingly large amounts of relevant data become available, it will be pivotal not only to use these emerging sources to derive novel insights on climate change, but to develop and improve statistical frameworks designed with climate change in mind. This thesis presents two novel applications of statistical learning to climate change, one of which includes a more general framework that can easily be extended beyond the field of climate change. Specifically, the work consists of two studies: (1) a robust integration of social media activity with climate survey data to relate climate-talk to climate-thought and (2) the development and validation of a statistical learning model to predict renewable energy installations using social, environmental, and economic predictors. The analysis presented in this thesis supports decision makers by providing new insights on the factors that drive climate attitude and adoption.