Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

8152330 · Jul 202019922001200920172026
48 results for postoperative complications

Deep learning models predict postoperative complications more accurately than random forests.

problem Predicting postoperative complications to inform patient care decisions.
method Multi-task deep neural networks integrating intraoperative physiological data.
result Deep learning models improved prediction accuracy and provided interpretable risk factors.

New monitoring method detects ML risk models' performance changes in medical interventions.

problem Monitoring ML risk models in healthcare is complicated by confounding medical interventions.
method Developed a new score-based CUSUM monitoring procedure with dynamic control limits.
result Valid inference is possible if conditional exchangeability or time-constant selection bias hold.

Develops new methods for risk-aware decision-making in medical bandits.

problem Risk-averse decision-making in medical contexts with limited data.
method Safe, anytime-valid concentration bounds, risk-aware contextual bandits, nonparametric algorithms.
result Improved decision-making algorithms for postoperative patient follow-up.

We propose a flexible method for estimating value functions in reinforcement learning without parametric assumptions.

problem Lack of interpretability in reinforcement learning models, especially in healthcare applications.
method Nonparametric additive model using local kernel regression and basis expansion.
result Personalized, adaptive recommendations for postoperative recovery.

Study describes severe dengue ICU patients in Brazil, 2012-2024.

problem Characterize severe dengue ICU patients and identify risk factors.
method Prospective study, descriptive statistics, logistic regression, machine learning.
result Advanced age, comorbidities, leukocytes, and platelets are significant risk factors for complications.

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 …

2017-04-27abs ↗pdf ↗

Let MM be a 3-manifold with torus boundary components T1T_1 and T2T_2. Let φ ⁣:T1T2φ\colon T_1 \to T_2 be a homeomorphism, MφM_φ the manifold obtained from MM by gluing T1T_1 to T2T_2 via the map φφ, and TT the image of T1T_1 in MφM_φ. We show that if φφ is "sufficiently complicated" then any incompressible or strongly …

2009-11-27abs ↗pdf ↗

Solar improves variable selection in high-dimensional data with complicated dependence structures.

problem Variable selection in ultrahigh dimensional data with severe multicollinearity and grouping effect issues.
method Subsample-ordered least angle regression (Solar) for ultrahigh dimensional data.
result Solar yields substantial improvements in sparsity, stability, and accuracy of variable selection compared to traditional methods.

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 …

2017-12-15abs ↗pdf ↗

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…

2018-01-10abs ↗pdf ↗

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…

2016-04-17abs ↗pdf ↗

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…

2013-02-27abs ↗pdf ↗

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…

2019-12-16abs ↗pdf ↗

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 …

2016-06-19abs ↗pdf ↗

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 Δσ=2gσΔσ=2g-σ.

2013-11-26abs ↗pdf ↗

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…

2023-03-13abs ↗pdf ↗

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…

2012-07-12abs ↗pdf ↗

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.

2009-03-10abs ↗pdf ↗

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…

2003-06-23abs ↗pdf ↗

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.

2017-04-09abs ↗pdf ↗

Proposes a new method for efficient manifold denoising robust to high dimensional noise.

problem Efficiently denoise manifolds in high dimensional spaces with complicated noise.
method Landmark diffusion and optimal shrinkage under high dimensional noise and compact manifold setup.
result Systematic comparison with other algorithms on simulated and real datasets shows superior performance.

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…

2019-11-08abs ↗pdf ↗

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.

2010-02-11abs ↗pdf ↗

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…

2018-10-09abs ↗pdf ↗

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.

2013-11-13abs ↗pdf ↗

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…

2012-11-27abs ↗pdf ↗

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.

2016-08-02abs ↗pdf ↗

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 y=Aσ(Wx)+ξ, y = A σ(Wx) + ξ, where A,WA,W are weight matrices, ξξ represents noise, and the number of neurons in the hidden layer is no larger than the input or outp…

2018-10-16abs ↗pdf ↗