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,742 papers · 148 categories

Trend · papers per month

11223243 · Dec 201819922001200920172026
48 results for burn patients

A new model improves homogeneity in burn patient reimbursement.

problem Incomplete homogeneity checks for burn patients using LOS as a proxy.
method Cost-sensitive decision tree model considering patient-level cost and severity of burn.
result Identified groups with increased homogeneity compared to current HRG groups.

Bitcoin reacts positively to USDT minting but not burning, showing state-dependence.

problem Understanding Bitcoin's response to Tether's supply changes.
method Analyzing Bitcoin's intraday price movements in response to USDT minting and burning events.
result Bitcoin's response to USDT minting events declines after 60 minutes and is influenced by investor sentiment and public announcements.

In this paper we develop a method to compute the Burns-Epstein invariant of a spherical CR homology sphere, up to an integer, from its holonomy representation. As application, we give a formula for the Burns-Epstein invariant, modulo an integer, of a spherical CR structure on a Seifert fibered homology sphere in terms …

2008-11-29abs ↗pdf ↗

Interpool solves interoperability issues by minting, exchanging, and burning tokens within a single liquidity pool.

problem Lack of proper interoperability in blockchain use cases.
method Interpool operates as a standalone liquidity pool that mints, exchanges, and burns tokens, optimizing the order of transactions in the mempool.
result Interpool transforms front-running issues into a solution that ensures ultimate liquidity through a burning procedure, enabling trustless design.

The profitability of CPMMs is significantly impacted by mint and burn fees.

problem Understanding the profitability of decentralized exchanges.
method Formalized liquidity providers' profitability conditions, studied the effect of mint and burn fees, and compiled a large data set from Uniswap V2 transactions.
result The profitability of liquidity provision is severely affected by mint and burn costs.

We define a renormalized characteristic class for Einstein asymptotically complex hyperbolic (ACHE) manifolds of dimension 4: for any such manifold, the polynomial in the curvature associated to the characteristic class euler-3signature is shown to converge. This extends a work of Burns and Epstein in the Kahler-Einste…

2001-11-20abs ↗pdf ↗

The paper provides formulae for CR invariants in Sasakian η-Einstein manifolds.

problem Calculating CR invariants for a specific class of manifolds.
method Using renormalized characteristic forms, the Burns-Epstein invariant and other CR invariants are derived.
result The derived invariants are algebraically independent.

Study Kähler-Einstein manifolds with holomorphic isometries into blow-ups of complex spaces.

problem Characterizing Kähler-Einstein manifolds with holomorphic isometries into specific blow-ups.
method Analyzing properties of Kähler-Einstein manifolds and their isometries into generalized Burns-Simanca and Eguchi-Hanson manifolds.
result Generalized Burns-Simanca and Eguchi-Hanson manifolds are not relatives to any homogeneous bounded domain.

Recent work on imitation learning has generated policies that reproduce expert behavior from multi-modal data. However, past approaches have focused only on recreating a small number of distinct, expert maneuvers, or have relied on supervised learning techniques that produce unstable policies. This work extends InfoGAI…

2017-10-13abs ↗pdf ↗

ULA estimates covariance of log-concave distributions efficiently.

problem Estimating covariance matrices of log-concave distributions efficiently.
method Unadjusted Langevin algorithm (ULA) for sampling and covariance estimation.
result Sample complexity of single-chain ULA is smaller than that of parallel ULA by a logarithmic factor.

There is a well known link between (maximal) polar representations and isotropy representations of symmetric spaces provided by Dadok. Moreover, the theory by Tits and Burns-Spatzier provides a link between irreducible symmetric spaces of non-compact type of rank at least three and irreducible topological spherical bui…

2012-05-28abs ↗pdf ↗

The paper studies scalar flat Kähler metrics on line bundles and proves their properties.

problem Understanding scalar flat Kähler metrics on line bundles.
method Analyzes two families of scalar flat Kähler metrics on Cn+1\mathbb{C}^{n+1} and O(k)\mathcal{O}(-k), proving existence of asymptotic expansions and approximations.
result Characterizes the Burns-Simanca metric as the only projectively induced scalar flat metric on O(k)\mathcal{O}(-k) with a vanishing second coefficient in its asymptotic expansion.

A new algorithm reduces memory and computational needs for reinforcement learning.

problem Memory and computational inefficiency in model-free reinforcement learning.
method Memory-Efficient Nash Q-Learning (ME-Nash-QL) for two-player zero-sum games.
result Proves ME-Nash-QL reduces space and sample complexity for tabular and long-horizon cases.

SGD shows distinct phases in learning single-index models, achieving optimal sample complexity and regret.

problem Learning single-index models with SGD in adaptive data settings.
method Stochastic gradient descent (SGD) with an optimal learning rate schedule.
result SGD achieves near-optimal sample complexity and regret guarantees across both burn-in and learning phases.

New bounds on trajectory safety in training models with Langevin Dynamics.

problem Bounding the probability of a model's trajectory staying away from a designated failure region.
method Analyzes Langevin dynamics on smooth, strongly convex loss landscapes, introducing shape-free and local relaxation bounds.
result The in-set probability relaxes to the static value after a burn-in time of order d, using only the global spectral gap of the loss.

In this paper we extend our previous work on singularities of Monge-Ampère foliations to the case of pseudoconvex finite type domains. We are able to answer the questin of Burns on homogeneous polynomials whose logarithm satisfies the complex Monge-Ampère equation completely in dimension 2 . We are also able to general…

2005-05-27abs ↗pdf ↗

Improved forecasting of suicide attempts using LSGPs for patients with little data.

problem Challenges in predicting suicide attempts due to their rarity and patient heterogeneity.
method Introduced Latent Similarity Gaussian Processes (LSGPs) to capture patient heterogeneity.
result LSGPs outperform baseline models, even without kernel-design, and offer new insights into patient similarity.

Efficiently fine-tunes patient-independent seizure detection models with tensor kernel machine.

problem Improving seizure detection accuracy for wearable devices.
method Transfer learning with tensor kernel machine using canonical polyadic decomposition.
result Patient fine-tuned model achieves high performance with smaller model size.

Two algorithms learn Gaussian graphical models from Glauber dynamics trajectories.

problem Learning Gaussian graphical models from dependent data.
method Two complementary approaches: local edge-testing and burn-in/thinning reduction.
result Both approaches provide finite-sample recovery guarantees and empirical comparisons.

Simulates patient pathways to detect delayed rare disease diagnoses.

problem Delayed rare disease diagnoses in France, causing health system and patient harm.
method Probabilistic modelling of patient pathways to create an alert system.
result Alert system detects and refers wandering patients to CRMRs.

Researchers embed gravitational instantons in higher-dimensional spaces.

problem Embedding gravitational instantons in higher-dimensional spaces.
method Construct isometric and conformally isometric embeddings of gravitational instantons in R8\mathbb{R}^8 and R7\mathbb{R}^7.
result Embedding class of the Einstein--Maxwell instanton is equal to 3.

Model predicts wound and episode-level readmission risk and time to re-admit.

problem Identify patients at high risk of re-admission to prevent wound recurrences and reduce healthcare costs.
method Data-driven analysis of wound care and episode-level patient data.
result Model achieves high recall and precision for predicting re-admission risk and time.

Deep learning model creates patient representations for scalable EHR-based stratification.

problem Challenges in summarizing and representing patient data from EHRs prevent scalable stratification analysis.
method Unsupervised framework based on deep learning (ConvAE) using word embeddings, CNNs, and autoencoders.
result ConvAE significantly outperformed baselines in clustering diverse patient cohorts, identifying clinically relevant subtypes.

We study the problem of the existence and the holomorphicity of the Monge-Ampère foliation associated to a plurisubharmonic solutions of the complex homogeneous Monge-Ampère equation even at points of arbitrary degeneracy. We obtain good results for real analytic unbounded solutions. As a consequence we also provide a …

2009-06-25abs ↗pdf ↗

Characterizing a patient's progression through stages of sepsis is critical for enabling risk stratification and adaptive, personalized treatment. However, commonly used sepsis diagnostic criteria fail to account for significant underlying heterogeneity, both between patients as well as over time in a single patient. W…

2018-01-09abs ↗pdf ↗

Study automates detection of visitation disruptions in ICU patients.

problem Difficulty in detecting frequent visitation disruptions in ICU patients.
method Used DensePose R-CNN model to count people in video frames, analyzed disruptions and patient outcomes.
result Automated method detects visitation disruptions, impacts on pain and length of stay examined.

Bayesian methods improve group testing for identifying infected patients.

problem Identifying infected patients from group testing results with false positives.
method Bayesian inference and belief propagation algorithm, combined with expectation-maximization method.
result True-positive rate improved by considering credible intervals.