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

3857711,1561,541 · Jun 202019922001200920172026
48 results for Multi-Site Learning

HBR improves normative modeling of neuroimaging data across multiple sites.

problem Dealing with nuisance variation in neuroimaging data across different sites.
method Hierarchical Bayesian regression (HBR) for multi-site normative modeling.
result HBR provides more accurate normative ranges compared to existing methods.

New federated method preserves privacy and estimates treatment effects.

problem Privacy-preserving causal inference for multi-site studies.
method Multiply robust nuisance function estimation, transfer learning.
result Efficient and optimal treatment effect estimation under different scenarios.

FONT clusters patients across health systems with privacy and efficiency.

problem Challenges in multi-site cluster analysis due to data-sharing restrictions.
method Federated One-shot Ensemble Clustering (FONT) algorithm that requires only a single round of communication and exchanges only fitted model parameters and class labels.
result FONT improves consistency of patient clusters across sites compared to locally fitted clusters.

Paper tackles robust decision-making from multiple sites with shared structure.

problem Learning robust sequential decisions from heterogeneous multi-site datasets.
method Group-Robust MDPs with d-rectangular uncertainty sets, feature-wise worst-case aggregation, and cluster-level pooling.
result Proves suboptimality bound for robust planning policy under robust partial coverage assumption.

Purpose: In the present work we describe the correction of diffusion-weighted MRI for site and scanner biases using a novel method based on invariant representation. Theory and Methods: Pooled imaging data from multiple sources are subject to variation between the sources. Correcting for these biases has become very im…

2019-04-10abs ↗pdf ↗

Paper benchmarks CF mitigation in federated time series forecasting.

problem Catastrophic forgetting in federated learning for time series forecasting.
method Comprehensive evaluation of CF mitigation strategies in federated time series forecasting.
result Introduction of a new benchmark for CF in time series federated learning.

Collecting the large datasets needed to train deep neural networks can be very difficult, particularly for the many applications for which sharing and pooling data is complicated by practical, ethical, or legal concerns. However, it may be the case that derivative datasets or predictive models developed within individu…

2018-05-28abs ↗pdf ↗

FedRD improves risk difference estimation in federated learning for clinical outcomes.

problem Privacy-preserving model co-training in medical research is hindered by server-dependent architectures and focus on relative effect measures.
method FedRD is a server-independent, communication-efficient framework for federated risk difference estimation in distributed survival data.
result FedRD provides valid confidence intervals and hypothesis testing, and is asymptotically equivalent to pooled individual-level analysis.

Infrastructure monitors AI/ML radiology models across multiple sites.

problem Monitoring and improving AI/ML radiology models across multiple sites.
method Interactive radiology reporting, centralized cloud system, post-marketing surveillance.
result Efficient monitoring and iterative development of AI/ML models without radiologist burden.

Improved 3D MRI classification using contrastive learning with continuous proxy metadata.

problem Insufficient labelled data for 3D medical image classification.
method Proposed a new loss function (y-Aware InfoNCE) to leverage continuous proxy metadata in contrastive learning.
result 3D CNN model pre-trained on 10^4 multi-site healthy brain MRI scans outperforms fully-supervised methods.

New model extracts shared brain activity patterns from fMRI data.

problem Challenges in aggregating multi-subject fMRI data due to variability.
method Shared Gaussian Process Factor Analysis (S-GPFA) incorporating temporal information.
result Model reveals ground truth latent structures and replicates experimental performance.

Deep chest X-ray classifiers show bias in predicting diagnoses.

problem Bias in deep learning classifiers predicting diagnoses from chest X-rays.
method Trained convolutional neural networks on multiple public datasets to predict 14 diagnostic labels.
result True positive rates vary significantly among different protected attributes, indicating bias.

Transformer model pretrains on synthetic graphs for AD detection.

problem Limited labeled data and class imbalance in AD diagnosis.
method Diffusion-generated synthetic graphs, Graph Transformers, transfer learning.
result Framework outperforms baselines in AD diagnosis metrics.

New method calibrates asynchronous, error-prone covariates for longitudinal data.

problem Estimation biases and slow convergence in analyzing time-varying covariates with measurement error.
method Functional calibration approach based on functional principal component analysis.
result Asymptotically unbiased and consistent estimators for time-invariant coefficients; optimal convergence rate for time-varying coefficients.

New fair regression method improves fairness in chronic kidney disease classification.

problem Mitigating societal bias in health care for multiple groups.
method Penalized fair regression framework for multiple groups, with penalties for true positive rate disparity.
result Achieves fairness-accuracy frontier beyond existing methods in simulations and real-world data.

Develops adaptive algorithms for sustainable fertilizer use in agriculture.

problem Sustaining high yields while reducing environmental impacts of fertilizer use.
method Nonlinear model-based bandit algorithms linking biological processes to decision-making.
result Faster learning and higher profits with interpretable recommendations.

RESPIRE calibrates low-cost air-quality sensors for CO levels, resistant to outliers.

problem Calibrating LCAQ sensors against regulatory-grade monitors is expensive and time-consuming.
method PROvably outlier-resistant semi-parametric regression technique.
result RESPIRE offers improved prediction in cross-site, cross-season, and cross-sensor settings.

Synthetic learning improves neonatal brain MRI segmentation robustness.

problem Challenges in neonatal brain MRI segmentation due to image contrast and anatomical variations.
method Synthetic learning model trained on few T2-weighted volumes, then enhanced with motion artifacts and over-segmentation.
result Synthetic learning robust to image contrast and improves segmentation of both T1- and T2-weighted images.

Study models extreme skew surges along French Atlantic coast.

problem Appropriate modelling of extreme skew surges for coastal risk management.
method Peak-over-threshold framework, multivariate generalized Pareto distribution, extreme regression framework.
result Reconstructed historical skew surge time series at stations with limited data.

Meta-learning improves neural networks by adapting learning algorithms.

problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.

Machine learning models adapt to motor learning but face challenges.

problem Adapting machine learning to handle motor variability and differentiate new movements from known ones.
method Parameter adaptation, transfer and meta-learning, reinforcement learning.
result Challenges in applying machine learning models for motor learning support systems.

New method uses bi-level optimization to learn useful representations for imitation learning.

problem Learning useful representations for multiple tasks in imitation learning settings.
method Formulates representation learning as a bi-level optimization problem.
result Bi-level optimization framework provides sample complexity benefits for imitation learning.

Study Whittle index learning algorithms for restless bandits with constant stepsizes.

problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.

New unsupervised learning technique learns independent kernels for better machine learning tasks.

problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.

New self-imitation learning method improves performance in continuous control tasks.

problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.

Deep reinforcement learning finds optimal learning policies for adaptive systems.

problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.

Study batch reinforcement learning methods for personalized medical treatments.

problem Batch reinforcement learning for personalized medical treatments.
method Direct policy learning and model-based learning approaches.
result Model-based learning is impossible with finite model classes but feasible with relaxed conditions.

A new meta-meta classification method tackles few-shot learning tasks.

problem Learning with limited data in small-data settings.
method Designing an ensemble of learners for a large set of problems, then learning how to combine them for a new problem.
result Meta-meta classification outperforms traditional meta-learning and ensembling approaches in one-shot learning tasks.