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

0.3%0.5%0.8%0.7% · Jul 200619922001200920172026
48 results for HSA delineation

This study compares community detection algorithms for delineating health service areas.

problem Delineating health service areas to improve health care services.
method Comparative analysis of community detection algorithms on hospital-patient discharge networks.
result Infomap algorithm produced the best delineation of health service areas.

New RL algorithm reduces policy switching cost to loglog(T) with similar regret.

problem Low policy switching cost in real-life RL applications.
method Stage-wise exploration and adaptive policy elimination.
result Regret of O(HSAloglogT)O(HSA \log\log T) with O(HSAloglogT)O(HSA \log\log T) switching cost.

Graph embeddings from commute networks identify socioeconomic disparities in urban areas.

problem Urban delineation and socioeconomic group identification.
method Graph Neural Network (GNN) for modeling commute networks and deriving node embeddings.
result GNNs effectively capture socioeconomic disparities between urban communities.

We take initial steps in studying PAC-MDP algorithms with limited adaptivity, that is, algorithms that change its exploration policy as infrequently as possible during regret minimization. This is motivated by the difficulty of running fully adaptive algorithms in real-world applications (such as medical domains), and …

2019-05-30abs ↗pdf ↗

ECG-DelNet uses neural networks to accurately delineate ECGs, even with low-quality data.

problem Lack of model explainability and small databases limit deep learning applicability in ECG detection.
method Adapted U-Net architecture for 1D data, used PhysioNet's QT database, applied data augmentation and regularization techniques.
result Best configuration achieved high precision and recall for P, QRS, and T waves.

CNNs can be trained with clinically available segmentations for OARs in radiotherapy.

problem Lack of dedicated training volumes for CNNs in radiotherapy.
method Used clinically available segmentations from PACS, applied multi-label segmentation, empirically assessed training set size.
result Clinically available segmentations can be used to train an accurate OAR segmentation model.

Algorithm generates adaptive confidence sets for instance segmentation with guaranteed coverage.

problem Uncalibrated predictions and lack of uncertainty quantification in instance segmentation models.
method Conformal prediction algorithm to generate adaptive confidence sets with provable guarantees.
result Empirically, prediction sets vary in size based on query difficulty and attain target coverage, outperforming baselines.

Image segmentation is widely used in a variety of computer vision tasks, such as object localization and recognition, boundary detection, and medical imaging. This thesis proposes deep learning architectures to improve automatic object localization and boundary delineation for salient object segmentation in natural ima…

2019-09-19abs ↗pdf ↗

New CNN architecture improves pediatric image segmentation by homogenizing pose and size.

problem Challenges in segmenting pediatric images due to pose and size heterogeneity.
method Spatial Transformer Network (STN) for pose and scale invariance, combined with UNet for segmentation.
result Improved pediatric segmentation, especially renal tumor delineation, with accelerated processing.

Geospatial ML models need special evaluation methods due to their unique challenges.

problem Evaluating geospatial machine learning models is challenging due to their specific characteristics.
method Delineated unique challenges and proposed concrete takeaways for improving geospatial model evaluations.
result Concrete takeaways for improving evaluations of geospatial model performance.

Study on new metrics on para-Kähler-Norden manifolds with conformal deformation.

problem Exploring geometric and harmonic properties of new metrics.
method Conformal deformation of Berger-type metric, analysis of Levi-Civita link, study of curvature varieties, and harmonic maps.
result Detailed examination of curvature varieties and harmonic maps on the manifold.

The bane of one-class collaborative filtering is interpreting and modelling the latent signal from the missing class. In this paper we present a novel Bayesian generative model for implicit collaborative filtering. It forms a core component of the Xbox Live architecture, and unlike previous approaches, delineates the o…

2013-09-26abs ↗pdf ↗

The paper studies geometric structures in perfect fluid spacetimes with specific metrics.

problem Analyzing the geometric properties of perfect fluid spacetimes with specific metrics.
method Investigates conditions for conformal Ricci-Yamabe soliton and derives Laplace equations.
result Conditions for expanding, steady, or shrinking conformal Ricci-Yamabe solitons are identified.

The instance segmentation problem intends to precisely detect and delineate objects in images. Most of the current solutions rely on deep convolutional neural networks but despite this fact proposed solutions are very diverse. Some solutions approach the problem as a network problem, where they use several networks or …

2019-02-01abs ↗pdf ↗

Unified model for interactive estimation with improved learnability measure.

problem Improving learnability in interactive estimation models.
method Introducing a combinatorial measure (dissimilarity dimension) and a general algorithm with polynomial bounds.
result Unified model subsumes statistical-query learning and structured bandits.

Data augmentation doesn't improve robustness, contrary to belief.

problem The effectiveness of data augmentation in improving model robustness is questioned.
method Taking a Domain Generalization viewpoint, the study examines the robustness of augmented representations.
result Augmented representations are not robust to distortions used during training.

We formalize the notion of nesting probabilistic programming queries and investigate the resulting statistical implications. We demonstrate that while query nesting allows the definition of models which could not otherwise be expressed, such as those involving agents reasoning about other agents, existing systems take …

2018-03-16abs ↗pdf ↗

Study shows optimal RL with transition look-ahead is NP-hard for 2\ell \geq 2.

problem Optimal reinforcement learning with transition look-ahead is computationally hard.
method Proved NP-hardness for 2\ell \geq 2 using linear programming.
result There is a precise boundary between tractable and intractable cases for RL with look-ahead.

Study optimal consumption and investment strategies with leverage constraints using Epstein-Zin utility.

problem Optimal portfolio choice under leverage constraints and Epstein-Zin utility.
method Established viscosity solution to HJB equation, demonstrated smoothness, characterized optimal strategies, derived explicit solutions.
result Explicit solutions for optimal consumption and investment strategies under leverage constraints.

Time-aware fact-checking improves veracity predictions for time-sensitive claims.

problem Fact-checking decisions should consider temporal information of claims and evidence.
method Investigated four temporal ranking methods to optimize evidence ranking for fact-checking models.
result Time-aware evidence ranking surpasses relevance assumptions and improves veracity predictions for time-sensitive claims.

Economies are complex man-made systems where organisms and markets interact according to motivations and principles not entirely understood yet. The increasing dissatisfaction with the postulates of traditional economics i.e. perfectly rational agents, interacting through efficient markets in the search of equilibrium,…

2012-05-14abs ↗pdf ↗

Probabilistic programming aids in automatically dating ice cores, reducing manual error and uncertainty.

problem Automatically dating ice cores with high accuracy and capturing uncertainty.
method Probabilistic models and probabilistic programming for automatic inference.
result Demonstrated the use of probabilistic programming for ice core dating, showcasing its benefits and limitations.

The paper tackles entry prediction in row/column-exchangeable matrices with arbitrary missing data.

problem Prediction in matrices with arbitrary missing data.
method Proposes two practical algorithms: one for fast emulation and another for acceleration using algorithmic stability.
result Demonstrates superior performance in synthetic and real-world data sets.