Detects malware-infected clients and malicious domains using transfer learning.
problem Detecting malware-infected computers and malicious web domains from encrypted HTTPS traffic.
method Transfer learning with sluice networks to bootstrap each other's detection models.
result Outperforms known reference models and detects previously unknown malware and domains.
Study reveals hidden infections and infection dynamics from early data.
problem Understanding early infection dynamics and hidden infections in COVID-19.
method Data-driven machine learning analysis focusing on infection counts over time.
result Significant asymptomatic infections, 10-day lag, and strong infectious force.
A new model characterizes undocumented and asymptomatic infections to quantify COVID-19 uncertainties.
problem Quantifying uncertainties in COVID-19 infections and contagion.
method SUDR model: characterizes undocumented and documented infections, captures probabilistic density, and incorporates Bayesian inference.
result Demonstrates deeper understanding of COVID-19 uncertainties compared to classic models.
Satellite constructions on a knot can be thought of as taking some strands of a knot and then tying in another knot. Using satellite constructions one can construct many distinct isotopy classes of knots. Pushing this further one can construct distinct concordance classes of knots which preserve some algebraic invarian…
This study proposes a method to predict ICU infections from imbalanced data using clustering-based undersampling and ensemble classifiers.
problem Predicting healthcare-associated infections in ICU patients from imbalanced data.
method Clustering-based undersampling strategy combined with ensemble classifiers.
result The proposed method outperforms other resampling techniques in predicting ICU infections.
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.
CRISP predicts individual-level COVID-19 risk based on contact data.
problem Estimating individual-level infection risk during the pandemic.
method Probabilistic graphical model using SEIR framework with contact data.
result Model accurately predicts infection spread and recovery times.
Modeling infection hotspots to quantify effects of contact tracing and testing.
problem Capturing the role of infection hotspots in disease transmission.
method Temporal point process modeling framework to represent visits and disease transmission.
result Estimation of transmission rates at sites and households using Bayesian optimization.
Algorithm detects surgical site infections from hospital data.
problem Reduces incidence of surgical site infections in hospitals.
method Machine learning algorithms trained on hospital data.
result Identifies all SSIs with minimal false positives.
Deep learning identifies transcriptomic patterns and cell types associated with SARS-CoV-2 infection and COVID-19 severity.
problem Understanding how SARS-CoV-2 varies in infecting and causing severe COVID-19.
method Developed a new approach to generating self-supervised edge features, using Graph Attention Networks (GAT) and Set Transformer.
result Achieved state-of-the-art performance in predicting disease state of individual cells using single-cell RNA sequencing data.
Paper proposes a new method for more accurate group testing of infected patients.
problem Identifying infected patients efficiently with reduced tests and corrected errors.
method Adaptive design of pools based on Bayesian posterior prediction using belief propagation algorithm.
result The proposed method results in more accurate identification of infected patients.
Machine learning improves diagnostic test accuracy for bovine tuberculosis.
problem Improving diagnostic test sensitivity for bovine tuberculosis.
method Machine learning to assess risk landscapes and predict infection.
result Test sensitivity improved, detecting 240 more infected herds per year.
A time-dependent SIR model predicts COVID-19 spread and herd immunity.
problem Modeling and predicting COVID-19 spread and herd immunity.
method Time-dependent SIR model with 2 types of infected persons (detectable and undetectable).
result The model accurately predicts the turning point and herd immunity threshold.
New Milnor's invariant condition for topologically slice links.
problem Conditions for topologically slice links involving Milnor's invariant.
method Different Milnor's invariant condition to handle cases not covered by previous theorem.
result New sufficient conditions for topologically slice links.
LSTM models predict low likelihood of another COVID-19 wave in India.
problem Inaccurate and unreliable COVID-19 infection forecasting models due to data limitations and model complexity.
method Application of LSTM, bidirectional LSTM, and encoder-decoder LSTM models for multi-step infection forecasting.
result Predictions indicate low likelihood of another wave in October and November 2021.
Novel method combines neural network features with survival models for ICU infections.
problem Improving predictive models of ICU infections while maintaining interpretability.
method Semi-parametric approach combining low-resolution and high-resolution data.
result Improved predictive power with interpretability maintained.
Budney recently constructed an operad that encodes splicing of knots. He further showed that the space of (long) knots is generated over this operad by the space of torus knots and hyperbolic knots, thus generalizing the satellite decomposition of knots from isotopy classes to the level of the space of knots. Infection…
We consider the problem of learning the weighted edges of a graph by observing the noisy times of infection for multiple epidemic cascades on this graph. Past work has considered this problem when the cascade information, i.e., infection times, are known exactly. Though the noisy setting is well motivated by many epide…
Client adaptation improves federated learning performance with non-IID data.
problem Improving model performance in federated learning with non-identically and non-independently distributed data.
method Simulates heterogeneous clients to learn client-specific conditioning using a conditional gated activation unit.
result Client adaptation enhances model performance across balanced and imbalanced data sets from audio and image domains.
FedSTaS stratifies and samples clients for efficient FL.
problem Inefficient client sampling in federated learning.
method Stratifies clients based on compressed gradients, uses Neyman allocation for sampling, and samples local data uniformly.
result FedSTaS achieves higher accuracy than FedSTS in fixed training rounds.
Machine learning detects and diagnoses coughs for respiratory infections.
problem Detecting and diagnosing coughs for respiratory infections.
method Convolutional Neural Networks (CNNs) to detect cough events and diagnose three illnesses.
result Accuracy over 89% for detection and diagnosis.
Study of influenza A virus spread using mathematical equations.
problem Understanding the spread of influenza A virus infection.
method Mathematical model and analysis of dynamical system.
result Surface trajectories and asymptotic behavior of the system.
Acute respiratory infections have epidemic and pandemic potential and thus are being studied worldwide, albeit in many different contexts and study formats. Predicting infection from symptom data is critical, though using symptom data from varied studies in aggregate is challenging because the data is collected in diff…
This paper analyzes and improves convergence in federated learning with biased client selection.
problem Analyzing convergence in federated learning with biased client selection.
method First convergence analysis of federated optimization for biased client selection strategies, proposing Power-of-Choice framework.
result Power-of-Choice strategies converge up to 3 times faster and give 10% higher test accuracy than random selection.
New group testing method uses Belief Propagation for accurate screening.
problem Efficiently identifying infected samples in large groups with minimal tests.
method Belief Propagation algorithm for inference in group testing schemes.
result Significantly increased accuracy of infection identification with fewer tests.
This paper optimizes brokerage contracts for multiple clients trading a single asset.
problem Optimizing brokerage contracts for multiple clients trading a single asset.
method Endogenously determines clients' reservation values and strategically chooses clients. Characterizes optimal portfolios computationally.
result Characterizes optimal portfolios of clients and their profits, showing dependence on price impact coefficients.
Active Federated Learning selects clients to maximize efficiency.
problem Minimizing bandwidth usage and maximizing model accuracy in federated learning.
method Clients are selected with a probability conditioned on the current model and client data to maximize efficiency.
result Reduces the number of required training iterations by 20-70% while maintaining the same model accuracy.
Personalized federated learning for diverse client objectives.
problem Training a single global model across diverse local datasets is not optimal.
method Efficiently calculates optimal weighted model combinations for each client based on their specific objectives.
result Our method outperforms existing alternatives and enables new personalized features.
Paper uses UKS to improve BLE RSSI for proximity inference in mobile phone apps.
problem Improper BLE RSSI for accurate proximity inference during pandemics.
method Single-dimensional Unscented Kalman Smoother (UKS) with Gaussian process observation transforms.
result UKS outperforms traditional methods in predicting infection risk from BLE RSSI.
A new scheme for private computation splits client data into shares for server operations.
problem Private computation between client and server without revealing data.
method Stochastic scheme splitting client data into privatized shares.
result Server performs operations on privatized shares without learning raw data.
Bayesian optimization improves classifier selection for acute infection and mortality.
problem Improving accuracy of acute infection and mortality prediction.
method Comparison of hyperparameter optimization methods (grid search, random sampling, Bayesian optimization).
result Bayesian optimization outperforms grid search or random sampling for in-hospital mortality classifiers.
This work detects anomalous clients in federated learning to prevent their adverse impacts.
problem Detecting and preventing anomalous client behaviors in federated learning systems.
method Generates low-dimensional surrogates of model weight vectors and uses them for anomaly detection.
result The proposed detection-based approach significantly outperforms conventional defense-based methods.
Many works have been proposed in the literature to capture the dynamics of diffusion in networks. While some of them define graphical markovian models to extract temporal relationships between node infections in networks, others consider diffusion episodes as sequences of infections via recurrent neural models. In this…
Federated learning is a recent advance in privacy protection. In this context, a trusted curator aggregates parameters optimized in decentralized fashion by multiple clients. The resulting model is then distributed back to all clients, ultimately converging to a joint representative model without explicitly having to s…
A federated minimax framework for heterogeneous clients.
problem Training with edge devices having different datasets and capabilities.
method Proposes a federated minimax optimization framework with normalized updates.
result Improves convergence and communication complexity for nonconvex functions.
FedAMD framework improves federated learning with partial client participation.
problem Data heterogeneity and inactive client updates in partial client participation.
method Anchor sampling divides clients into anchor and miner groups, using large and small batches respectively.
result FedAMD achieves faster convergence and improved model performance compared to state-of-the-art methods.
Epidemiological model updates infection rates in China, US, Italy.
problem Evaluate policy interventions for mitigating the 2019-nCov pandemic.
method Custom SITR model with variational data assimilation for real-time updates.
result Model robust to initial conditions, infers infection numbers and parameters.
Robo-advisor improves investment advice through client interaction.
problem Offering personalized financial advice to clients.
method Adaptive mean-variance portfolio optimization with client interaction.
result Optimal investment strategy includes both myopic and intertemporal hedging terms.
Federated framework learns causal states to predict counterfactuals without centralizing data.
problem Decentralized counterfactual reasoning in coupled industrial systems with private data.
method Federated causal representation learning in state-space systems.
result Proves convergence to centralized oracle and provides privacy guarantees.
We give an explicit construction of linearly independent families of knots arbitrarily deep in the (n)-solvable filtration of the knot concordance group using the ρ^1-invariant. A difference between previous constructions of infinite rank subgroups in the concordance group and ours is that the deepest infecting knots i…
Study uses machine learning to optimize antibiotic therapy for MRSA skin infections.
problem Optimizing antibiotic choice for MRSA skin infections due to reduced treatment options and side effects.
method Propensity score matching, machine learning models (SVM, RF, LASSO), counterfactual analysis.
result RF model shows stronger treatment heterogeneity and potential for therapy change.
Unified Bayesian framework for clustered federated learning improves model performance.
problem Handling non-IID client data in federated learning.
method A unified Bayesian framework for clustered federated learning that associates clients to clusters and proposes practical algorithms for data associations.
result The proposed framework increases model performance by circumventing the need for unique client-cluster associations.
Study phase transitions in identifying infected individuals using group testing.
problem Identifying a set of k infected individuals from a population using pooled tests.
method Two random assignment designs (constant-column and Bernoulli) and polynomial-time inference procedures.
result Sharp phase transitions in statistical and computational limits for detection and recovery problems.
FLowDUP trains personalized models with unlabeled clients in low dimensions.
problem Training personalized models on clients with only unlabeled data.
method FLowDUP uses a forward pass with unlabeled data and a transductive PAC-Bayesian bound to generate personalized models in a low-dimensional subspace.
result FLowDUP enables efficient communication and computation with personalized models generated from unlabeled data.
Federated learning algorithm improves with intermittent client availability.
problem Performance degradation in Federated Averaging due to client availability changes.
method Federated Latest Averaging (FedLaAvg) uses latest gradients from all clients, even when unavailable.
result FedLaAvg achieves sublinear speedup compared to classical Federated Averaging.
The recent surge of text-based online counseling applications enables us to collect and analyze interactions between counselors and clients. A dataset of those interactions can be used to learn to automatically classify the client utterances into categories that help counselors in diagnosing client status and predictin…
DFedAvgM is a decentralized FedAvg with momentum for privacy and communication efficiency.
problem Efficiently train models with privacy and communication efficiency in federated learning.
method Decentralized Federated Averaging with Momentum (DFedAvgM) on clients connected by an undirected graph, using stochastic gradient descent with momentum and quantization.
result DFedAvgM converges under trivial assumptions and can be improved with the PŁ property, numerically verified.
Group personalization improves FL performance in heterogeneous client data.
problem Mitigating client drift in federated learning with heterogeneous data.
method Fine-tuning a global FL model over homogeneous groups of clients, then personalizing each group's model.
result The proposed method achieves superior personalization performance compared to other FL approaches.