Deep learning models predict postoperative complications more accurately than random forests.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Stratifying patients at risk for postoperative complications may facilitate timely and accurate workups and reduce the burden of adverse events on patients and the health system. Currently, a widely-used surgical risk calculator created by the American College of Surgeons, NSQIP, uses 21 preoperative covariates to asse…
New monitoring method detects ML risk models' performance changes in medical interventions.
Develops new methods for risk-aware decision-making in medical bandits.
PNNs improve treatment outcomes in TAVR and liver trauma.
Acute kidney injury (AKI) is a common and serious complication after a surgery which is associated with morbidity and mortality. The majority of existing perioperative AKI risk score prediction models are limited in their generalizability and do not fully utilize the physiological intraoperative time-series data. Thus,…
Logistic regression (LR) is widely used in clinical prediction because it is simple to deploy and easy to interpret. Nevertheless, being a linear model, LR has limited expressive capability and often has unsatisfactory performance. Generalized additive models (GAMs) extend the linear model with transformations of input…
We propose a flexible method for estimating value functions in reinforcement learning without parametric assumptions.
Study describes severe dengue ICU patients in Brazil, 2012-2024.
Type 2 diabetes mellitus (T2DM) is a chronic disease that often results in multiple complications. Risk prediction and profiling of T2DM complications is critical for healthcare professionals to design personalized treatment plans for patients in diabetes care for improved outcomes. In this paper, we study the risk of …
Mathematical method based on a direct or indirect analysis of growth rates is described. It is shown how simple assumptions and a relatively easy analysis can be used to describe mathematically complicated trends and to predict growth. Only rudimentary knowledge of calculus is required. Projected trajectories based on …
We construct families of manifolds that have pairs of genus Heegaard splittings that must be stabilized roughly times to become equivalent. We also show that when two unstabilized, boundary-unstabilized Heegaard splittings are amalgamated by a "sufficiently complicated" map, the resulting splitting is unstabili…
Diabetes is a major public health problem in the United States, affecting roughly 30 million people. Diabetes complications, along with the mental health comorbidities that often co-occur with them, are major drivers of high healthcare costs, poor outcomes, and reduced treatment adherence in diabetes. Here, we evaluate…
Let be a 3-manifold with torus boundary components and . Let be a homeomorphism, the manifold obtained from by gluing to via the map , and the image of in . We show that if is "sufficiently complicated" then any incompressible or strongly …
Solar improves variable selection in high-dimensional data with complicated dependence structures.
The theoretical existence of non-classical Schottky groups is due to Marden. Explicit examples of such kind of groups are only known in rank two, the first one by by Yamamoto in 1991 and later by Williams in 2009. In 2006, Maskit and the author provided a theoretical method to obtain examples of non-classical Schottky …
The goal of this paper is to describe a theoretical construction of an infinite collection of non-classical Schottky groups. We first show that there are infinitely many non-classical noded Schottky groups on the boundary of Schottky space, and we show that infinitely many of these are "sufficiently complicated". We th…
Let K be a fibered knot in the 3-sphere. We show that if the monodromy of K is sufficiently complicated, then Dehn surgery on K cannot yield a lens space. Work of Yi Ni shows that if K has a lens space surgery then it is fibered. Combining this with our result we see that if K has a lens space surgery then it is fibere…
Fast and efficient homology algorithms are in demand in the applied sciences for analyzing solid materials and proteins, processing digital imaging data, or pattern classification among others. Recent advances employ discrete Morse theory as a preprocessor. Research in this area has lead to the need to find complicated…
Accurate and reliable traffic forecasting for complicated transportation networks is of vital importance to modern transportation management. The complicated spatial dependencies of roadway links and the dynamic temporal patterns of traffic states make it particularly challenging. To address these challenges, we propos…
Let M_1 and M_2 be compact, orientable 3-manifolds with incompressible boundary, and M the manifold obtained by gluing with a homeomorphism $φ:\bdy M_1 \to \bdy M_2$. We analyze the relationship between the sets of low genus Heegaard splittings of M_1, M_2, and M, assuming the map φis "sufficiently complicated." This a…
VLSI mask optimization is one of the most critical stages in manufacturability aware design, which is costly due to the complicated mask optimization and lithography simulation. Recent researches have shown prominent advantages of machine learning techniques dealing with complicated and big data problems, which bring p…
In just three years, Variational Autoencoders (VAEs) have emerged as one of the most popular approaches to unsupervised learning of complicated distributions. VAEs are appealing because they are built on top of standard function approximators (neural networks), and can be trained with stochastic gradient descent. VAEs …
We prove that manifolds with complicated enough fundamental group admit measure-preserving homeomorphisms which have positive stable fragmentation norm with respect to balls of bounded measure.
Based on recent work by Futer, Kalfagianni and Purcell, we prove that the volume of sufficiently complicated positive braid links is proportional to the signature defect .
Let M_1 and M_2 be compact, orientable 3-manifolds, and M the manifold obtained by gluing some component F of \bdy M_1 to some component of \bdy M_2 by a homeomorphism φ. We show that when φis "sufficiently complicated" then (1) the amalgamation of low genus, unstabilized, boundary-unstabilized Heegaard splittings of M…
Motivated by the algorithmic study of 3-dimensional manifolds, we explore the structural relationship between the JSJ decomposition of a given 3-manifold and its triangulations. Building on work of Bachman, Derby-Talbot and Sedgwick, we show that a "sufficiently complicated" JSJ decomposition of a 3-manifold enforces a…
Smooth isotopy on cube saves energy with extra dimensions.
In this work, we give parallel transport frame of a curve and we introduce the relations between the frame and Frenet frame of the curve in 4-dimensional Euclidean space. The relation which is well known in Euclidean 3-space is generalized for the first time in 4-dimensional Euclidean space. Then we obtain the conditio…
In earlier work we introduced topologically minimal surfaces as the analogue of geometrically minimal surfaces. Here we strengthen the analogy by showing that complicated amalgamations act as barriers to low genus, topologically minimal surfaces.
Let M and M' be simple 3-manifolds, each with connected boundary of genus at least two. Suppose that M and M' are glued via a homeomorphism between their boundaries. Then we show that, provided the gluing homeomorphism is `sufficiently complicated', the Heegaard genus of the amalgamated manifold is completely determine…
Adaptive and sequential experiment design is a well-studied area in numerous domains. We survey and synthesize the work of the online statistical learning paradigm referred to as multi-armed bandits integrating the existing research as a resource for a certain class of online experiments. We first explore the tradition…
We establish a connection between Morin singularities and stable homotopy groups of spheres. This connection allows us to describe how the images of singularity strata behave around the image of a more complicated stratum.
Structured missing data complicates machine learning, presenting new challenges.
An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of strings is countable.
Proposes a new method for efficient manifold denoising robust to high dimensional noise.
The paper argues that attracting more economists and adopting a more-precise definition of dynamic complexity might help econophysics acquire more attention in the economics community and bring new lymph to economic research. It may be necessary to concentrate less on the applications than on the basics of economic com…
We construct families of pairs of Heegaard splittings that must be stabilized several times to become equivalent. The first such pair differs only by their orientation. These are genus n splittings of a closed 3-manifold that must be stabilized at least n-2 times to become equivalent. The second is a pair of genus n sp…
The financial services industry has unique explainability and fairness challenges arising from compliance and ethical considerations in credit decisioning. These challenges complicate the use of model machine learning and artificial intelligence methods in business decision processes.
We describe the fundamental groups of ordered and unordered k point sets in complex projective space of dimension n generating a projective subspace of dimension i. We apply these to study connectivity of more complicated configurations of points.
We propose an approach that connects recurrent networks with different orders of hidden interaction with regular grammars of different levels of complexity. We argue that the correspondence between recurrent networks and formal computational models gives understanding to the analysis of the complicated behaviors of rec…
In recent years, pattern analysis plays an important role in data mining and recognition, and many variants have been proposed to handle complicated scenarios. In the literature, it has been quite familiar with high dimensionality of data samples, but either such characteristics or large data have become usual sense in…
We provide a diagrammatic criterion for semi-adequate links to be hyperbolic. We also give a conjectural description of the satellite structures of semi-adequate links. One application of our result is that the closures of sufficiently complicated positive braids are hyperbolic links.
Every surface bundle with genus fiber has a canonical Heegaard splitting of genus . We classify the mapping class groups of such Heegaard splittings in the case when the surface bundle has a sufficiently complicated monodromy map.
We prove that for each sufficiently complicated orientable surface , there exists an infinite image linear representation of such that if is freely homotopic to a simple closed curve on , then has finite order. Furthermore, we prove that given a sufficiently complicated orientable…
We describe the explicit form and the hidden structure of the answer for the HOMFLY polynomial for the figure eight and some other 3-strand knots in representation [21]. This is the first result for non-torus knots beyond (anti)symmetric representations, and its evaluation is far more complicated. We provide a whole va…
The concept of $\Zn$-supermanifold has been recently proposed as a natural generalization of classical ($\Zs$-graded) supergeometry, allowing for more complicated commutativity constraints. Here we continue the study of $\Zn$-supergeometry by developing the foundations of differential calculus on $\Zn$-supermanifolds.
We give a new algorithm for learning a two-layer neural network under a general class of input distributions. Assuming there is a ground-truth two-layer network where are weight matrices, represents noise, and the number of neurons in the hidden layer is no larger than the input or outp…