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.

169,341 papers · 148 categories

Trend · papers per month

203406608811 · Jun 202019922001200920182026
48 results for complicated sets

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.

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.

Paper proposes a multi-task learning approach to predict multiple diabetes complications.

problem Risk prediction and profiling of diabetes complications for personalized treatment plans.
method Multi-task learning approach with coefficient shrinkage and hierarchical Bayesian framework.
result The proposed method outperforms state-of-the-art models in predicting multiple diabetes complications.

New model detects postoperative complications early after surgery.

problem Early detection of postoperative complications in patients.
method Hidden Markov Model sequence classifier analyzing postoperative temperature sequences.
result Improved classification performance compared to other machine learning classifiers.

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.

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 ↗

Authors construct an example of a Schottky group of rank three.

problem Theoretical existence of non-classical Schottky groups in higher ranks.
method Provided a method to construct sufficiently complicated noded Schottky groups of any rank.
result Explicit construction of a sufficiently complicated noded Schottky group of rank three.

AI identifies patient clusters for diabetes case management.

problem Diabetes complications and mental health comorbidities drive high healthcare costs.
method Combined AI techniques with diverse data sources for prediction and clustering.
result 83.5% accuracy in predicting diabetes complications and meaningful patient clusters.

We introduce a new operation, double point surgery, on immersed surfaces in a 4-manifold, and use it to construct knotted configurations of surfaces in many 4-manifolds. Taking branched covers, we produce smoothly exotic actions of Z/m x Z/n on simply connected 4-manifolds with complicated fixed-point sets.

2010-01-21abs ↗pdf ↗

This paper provides a ML framework for diabetes prediction and care management.

problem Diabetes prediction and care management challenges in real-world healthcare.
method Illustrates a Machine Learning framework for T2DM prediction and risk stratification.
result ML models align with physician's disease management steps.

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 ↗

We sharply characterize the performance of different penalization schemes for the problem of selecting the relevant variables in the multi-task setting. Previous work focuses on the regression problem where conditions on the design matrix complicate the analysis. A clearer and simpler picture emerges by studying the No…

2010-08-31abs ↗pdf ↗

The study predicts surgical complications in Crohn's disease patients using machine learning.

problem Predicting surgical complications in Crohn's disease patients.
method Developed a novel algorithm using ensemble machine learning on 29 baseline covariates.
result Proposed pseudo-observation based estimators for evaluating predictive performance.

Improved online convex optimization with long-term constraints achieving low regret and constraint violations.

problem Online convex optimization with long-term constraints over complicated sets.
method A new simple algorithm achieving O(T)O(\sqrt{T}) regret and O(1)O(1) constraint violations.
result Improved performance with O(T)O(\sqrt{T}) regret and O(1)O(1) constraint violations.

Develops a data-driven fault diagnosis framework for time-series data.

problem Fault diagnosis of dynamic systems using imbalanced and unknown fault classes.
method Kullback-Leibler divergence, data-driven fault classification, open-set classification.
result Framework handles imbalanced datasets, class overlapping, and unknown faults.

A simple framework improves deep metric learning performance.

problem Imbalanced data pairs in pairwise deep metric learning.
method Formulated a robust loss for balanced pairs over mini-batches, using distributionally robust optimization.
result Empirically outperforms state-of-the-art methods.

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 ↗

This study predicts diabetes complications using financial records and neural networks.

problem Managing chronic diseases like diabetes in patients.
method Used financial records from health plans, applied self-attentive recurrent neural networks.
result Successfully predicted diabetes complications with an AUC of 0.81-0.94, 60-240 days ahead.

New method trims network data to resist adversarial contamination.

problem Adversarial contamination in network data affects statistical and algorithmic performance.
method Proposes a new trimming method operating in model space to address both block and white noise contamination.
result Demonstrates superior performance in simulations compared to direct trimming.

EI-MTD defends edge intelligence against adversarial attacks with dynamic scheduling.

problem Adversarial attacks on edge intelligence models.
method EI-MTD uses differential knowledge distillation to create robust member models and a dynamic scheduling policy based on a Bayesian Stackelberg game.
result EI-MTD effectively protects edge intelligence from black-box adversarial attacks.

CDANs classify unordered feature sets efficiently and invariantly.

problem Classifying unordered feature sets with traditional neural networks leads to spurious patterns.
method Convolutional deep averaging networks (CDANs) for permutation-invariant classification.
result CDANs outperform linear embeddings and other methods in classifying unordered feature sets.

Eigenfunctions of the Dirac operator on spheres reveal complex nodal structures.

problem Finding eigenfunctions with specific nodal sets on spheres.
method Analyzing the Dirac operator on round spheres with arbitrary submanifolds.
result Eigenfunctions of the Dirac operator on spheres can have nodal sets corresponding to any given submanifolds.

This work introduces a noise-adaptive conformal inference method for better prediction sets in noisy data.

problem Real-world complications like random label noise limit the effectiveness of conformal inference.
method An adaptive conformal inference method capable of handling deviations from exchangeability.
result Informative prediction sets with tight marginal coverage guarantees in noisy data.

Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possibl…

2014-07-04abs ↗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 ↗

We present a short proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in details: {\bf Theorem.} Let MM be a connected oriented closed smooth 3-manifold. Let L1(M)L_1(M) be the set of framed links in MM up to a framed cobordism. Let °:L1(M)H1(M;Z)°:L_1(M)\to H_1(M;\Z) be the…

2007-05-29abs ↗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 ↗

Unified approach for robust and heavy-tailed mean estimation in high dimensions.

problem Estimating mean in high dimensions with adversarial corruption or heavy-tailed distributions.
method Unified meta-problem and duality theorem leading to Filter algorithm and QUE scheme.
result Unified and efficient algorithms for both robust and heavy-tailed mean estimation.