arXivDaily arXiv每日学术速递 周一至周五更新
重置
1906.10019 2026-04-26 stat.ML cs.LG

Machine Learning Construction: implications to cybersecurity

Waleed A. Yousef

详情
英文摘要

Statistical learning is the process of estimating an unknown probabilistic input-output relationship of a system using a limited number of observations. A statistical learning machine (SLM) is the algorithm, function, model, or rule, that learns such a process; and machine learning (ML) is the conventional name of this field. ML and its applications are ubiquitous in the modern world. Systems such as Automatic target recognition (ATR) in military applications, computer aided diagnosis (CAD) in medical imaging, DNA microarrays in genomics, optical character recognition (OCR), speech recognition (SR), spam email filtering, stock market prediction, etc., are few examples and applications for ML; diverse fields but one theory. In particular, ML has gained a lot of attention in the field of cyberphysical security, especially in the last decade. It is of great importance to this field to design detection algorithms that have the capability of learning from security data to be able to hunt threats, achieve better monitoring, master the complexity of the threat intelligence feeds, and achieve timely remediation of security incidents. The field of ML can be decomposed into two basic subfields: \textit{construction} and \textit{assessment}. We mean by \textit{construction} designing or inventing an appropriate algorithm that learns from the input data and achieves a good performance according to some optimality criterion. We mean by \textit{assessment} attributing some performance measures to the constructed ML algorithm, along with their estimators, to objectively assess this algorithm. \textit{Construction} and \textit{assessment} of a ML algorithm require familiarity with different other fields: probability, statistics, matrix theory, optimization, algorithms, and programming, among others.f

2604.21201 2026-04-26 math.GT math.DS

Cannon--Thurston maps for Anosov foliations

Ellis Buckminster

Comments 38 pages, 21 figures. Comments welcome!

详情
英文摘要

Universal circles, introduced by Thurston and Calegari--Dunfield, are not well understood in general. Recently, the author together with Taylor showed that Anosov foliations with branching admit nonconjugate universal circles. We continue the study of these universal circles and show that for an Anosov foliation with branching on a hyperbolic manifold, the leftmost universal circle admits a Cannon--Thurston-type map to the ideal 2-sphere. This is a new type of construction of a Cannon--Thurston map. As a corollary, we show the fundamental group of the manifold acts on the leftmost universal circle with pseudo-Anosov dynamics.