New method transplants specific neural networks to generic ones without training samples.
problem Learning massive tasks and categories requires collecting samples for all at once.
method Designs a functionally interpretable generic network and uses back-distillation for transplanting.
result Method without training samples outperforms with 100 samples.
This paper focuses on a new task, i.e., transplanting a category-and-task-specific neural network to a generic, modular network without strong supervision. We design an functionally interpretable structure for the generic network. Like building LEGO blocks, we teach the generic network a new category by directly transp…
Paper develops a model to predict kidney transplant success.
problem Mismatched deceased donor-recipient kidney leads to post-transplant death.
method Data analysis of 584 imported kidneys from 12 transplant centers.
result Predicting model reduces mortality rate due to kidney mismatch.
Machine learning improves kidney transplant outcomes prediction.
problem Improving prediction of kidney transplant success.
method Random forest machine learning model trained on kidney donor risk index data.
result Random forest predicted 2,148 more successful transplants than the risk index.
Paper learns data-driven organ matching rules from observational data.
problem Tackles organ transplantation compatibility using observational data.
method Representation learning to cluster donors and apply recipient transformations.
result Model outperforms human experts in predicting transplant outcomes.
Background: Many authors have described MELD as a predictor of short-term mortality in the liver transplantation waiting list. However MELD score accuracy to predict long term mortality has not been statistically evaluated. Objective: The aim of this study is to analyze the MELD score as well as other variables as a pr…
John Conway created pairs of domains that sound the same for a special kind of music.
problem Creating domains that sound the same for a special kind of music.
method Using his theory of quilts, Conway developed pairs of glueing diagrams.
result Conway's pairs of domains are isospectral for the Laplace operator.
Liver transplant patients have a 25% chance of developing diabetes within 5 years.
problem Predicting new onset diabetes after liver transplant to improve patient care.
method Comparison of time-to-event prediction models and classifiers, including regularized Cox proportional-hazards model.
result Regularized Cox proportional-hazards model achieved high Concordance Index of 0.863.
We study isospectrality for manifolds with mixed Dirichlet-Neumann boundary conditions and express the well-known transplantation method in graph- and representation-theoretic terms. This leads to a characterization of transplantability in terms of monomial relations in finite groups and allows for the generating of ne…
We say that a germ G of a geometric structure can be transplanted into a manifold M if there is a suitable geometric structure on M which agrees with G on a neighborhood of some point P of M. We show for a wide variety of geometric structures that this transplantation is always possible provided that M does in fact adm…
This paper presents the first deep reinforcement learning (DRL) framework to estimate the optimal Dynamic Treatment Regimes from observational medical data. This framework is more flexible and adaptive for high dimensional action and state spaces than existing reinforcement learning methods to model real-life complexit…
Method learns evolving policies in healthcare contexts.
problem Understanding non-stationary behavior in evolving decision-making processes.
method Inverse Contextual Bandits (ICB) approach for learning interpretable representations of non-stationary behavior.
result Demonstrated applicability and accuracy of ICB method in liver transplantation policies.
New method for finding optimal treatment regimes in medical settings with time-varying unobserved factors.
problem Finding optimal treatment regimes in medical settings with time-varying unobserved factors.
method Extend Dynamic Treatment Regimes (DTRs) to Ambiguous Dynamic Treatment Regimes (ADTRs), connect to Ambiguous Partially Observable Mark Decision Processes (APOMDPs), and develop Reinforcement Learning methods.
result Established theoretical results for learning methods, including consistency and asymptotic normality.
We prove that C. Loewner's inequality for the torus is satisfied by all hyperelliptic surfaces X, as well. We first construct the Loewner loops on the (mildly singular) companion tori, locally isometric to X away from the Weierstrass points. The loops are then transplanted to X, and surgered to obtain a Loewner loop on…
Study dynamic matching in heterogeneous networks using ODE model.
problem Dynamic matching in heterogeneous networks with compatibility restrictions.
method Introduced an ODE model to evaluate matching algorithms.
result Demonstrated trade-off between quick matching and optimal matching.
Local discovery method uncovers direct unfairness in complex systems.
problem Identifying causal pathways of unfairness in complex domains.
method Local discovery for direct discrimination (LD3) method.
result LD3 returns a valid adjustment set (VAS) for assessing unfairness.
Paper presents an ensemble model for predicting readmission using clinical notes.
problem Limited use of clinical notes in predicting readmission due to their unstructured nature.
method Ensemble model combining vector space modeling and topic modeling.
result Improves readmission prediction by 0.0211 in c-statistics.
Introduction. Case Based Reasoning (CBR) is an emerg- ing decision making paradigm in medical research where new cases are solved relying on previously solved similar cases. Usually, a database of solved cases is provided, and every case is described through a set of attributes (inputs) and a label (output). Extracting…
Proposes a neural network for dynamic risk prediction of AMD using longitudinal fundus images.
problem Dynamic risk prediction for progressive eye disorders like AMD.
method tdCoxSNN, a time-dependent Cox survival neural network integrating CNN.
result Demonstrates commendable predictive performance in AMD and PBC datasets.
Many complex ecosystems, such as those formed by multiple microbial taxa, involve intricate interactions amongst various sub-communities. The most basic relationships are frequently modeled as co-occurrence networks in which the nodes represent the various players in the community and the weighted edges encode levels o…
New energy measure for isolated systems in general relativity.
problem Quantifying energy in isolated systems in general relativity.
method Optimal isometric embedding and conformal Killing fields.
result Finite quasi-local energies for asymptotically flat spacetimes.
Given a hyperelliptic Klein surface, we construct companion Klein bottles, extending our technique of companion tori already exploited by the authors in the genus 2 case. Bavard's short loops on such companion surfaces are studied in relation to the original surface so to improve a systolic inequality of Gromov's. A ba…
This paper proposes a non-parallel many-to-many voice conversion (VC) method using a variant of the conditional variational autoencoder (VAE) called an auxiliary classifier VAE (ACVAE). The proposed method has three key features. First, it adopts fully convolutional architectures to construct the encoder and decoder ne…
Although much progress has been made in classification with high-dimensional features \citep{Fan_Fan:2008, JGuo:2010, CaiSun:2014, PRXu:2014}, classification with ultrahigh-dimensional features, wherein the features much outnumber the sample size, defies most existing work. This paper introduces a novel and computation…
The paper examines how macroeconomic control tools lost effectiveness, leading to a 'dark ages' period.
problem Loss of effectiveness of control tools in macroeconomic stabilization policy.
method Historical analysis of macroeconomic stabilization policy from 1948 to 1993.
result The overstatement of the Lucas critique and Kydland and Prescott's time-inconsistency led to a period of ineffective stabilization policy.
This article considers the quasi-local conserved quantities with respect to a reference spacetime with a cosmological constant. We follow the approach developed by the authors in [25,26,7] and define the quasi-local energy as differences of surface Hamiltonians. The ground state for the gravitational energy is taken to…
In this paper, by extending the notions of harmonic transplantation and harmonic radius in the Heisenberg group, we give an upper bound for the first eigenvalue for the following Dirichlet problem: $$(P_Ω) \left\{ \begin{array}{lllll} -Δ_{\mathbb{H}^1} u & = & λu & \mbox{in} & Ωu & = & 0 & \mbox{on} & \partial Ω, \end{…
We describe in this talk three methods of constructing different links with the same Jones type invariant. All three can be thought as generalizations of mutation. The first combines the satellite construction with mutation. The second uses the notion of rotant, taken from the graph theory, the third, invented by Jones…
The paper proposes a method to infer multi-objective rewards from preferences.
problem Modeling preferences based on multiple, often competing objectives.
method Modeling priorities lexicographically and inferring multi-objective rewards from observed preferences.
result Lexicographically-ordered rewards provide a better understanding of preferences and improve policies.
TransformerLSR models longitudinal, recurrent, and survival data jointly.
problem Joint modeling of longitudinal measurements, recurrent events, and survival data with dependencies.
method Transformer-based deep learning framework integrating deep temporal point processes and latent structure representation.
result TransformerLSR effectively models all three components simultaneously, demonstrating necessity and effectiveness through simulations and real-world data.
Deep learning classifies keratoconus patients with high accuracy.
problem Accurately identifying keratoconus patients for early intervention.
method Unsupervised and semi-supervised machine learning models using corneal topography and clinical data.
result Unsupervised method with 29 variables shows better classification accuracy.
We define quasi-local conserved quantities in general relativity by using the optimal isometric embedding in [26] to transplant Killing fields in the Minkowski spacetime back to the 2-surface of interest in a physical spacetime. To each optimal isometric embedding, a dual element of the Lie algebra of the Lorentz group…
Novel deep learning model improves AUC prediction for tacrolimus dosing.
problem Model misspecification in current pharmacokinetic models.
method Latent Neural-ODE for learning individualized pharmacokinetic dynamics.
result Latent ODE model outperforms standard methods in AUC prediction accuracy.
Survey on deep learning for social network analysis.
problem Encoding social network data into useful low-dimensional representations.
method Review of neural network models for node and subgraph embeddings in various network types.
result Advancements in deep learning for complex network analysis.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
Algorithm reconstructs conserved networks from flow data.
problem Network reconstruction from flow data.
method Polynomial time algorithm exploiting graph theoretic properties and learning techniques.
result Exact network reconstruction possible for arborescence networks.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular information and identifying the roles of microscopic elements in network data can help us …
DCNs mimic neuronal networks for improved neural classification.
problem Lack of topological similarity between DNNs and biological neural networks.
method Developed DCNs with topologies inspired by real-world neuronal networks.
result High classification accuracy achieved by DCNs.
Network Lens identifies node behaviors in heterogeneous networks with high accuracy.
problem Identifying different behaviors in various parts of large heterogeneous networks.
method Zoom into network using different-sized lenses to capture local structure, weight signatures to predict node labels.
result Achieved a peak accuracy of ~42% on two networks with ~100,000 and ~1,000,000 nodes, significantly better than random.
DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
problem Vulnerability of capsule networks to adversarial attacks.
method Compared capsule networks to convolutional neural networks using various adversarial attacks.
result Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Deep ReLU networks can be simplified to a three-layer model.
problem Understanding the behavior of deep neural networks.
method Constructive proof and algorithm to transform deep networks into shallow ones.
result Deep ReLU networks can be represented by a simpler three-layer structure.
Tackles network structure inference from time series data using GNN.
problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.
Network embedding helps predict speed limits on incomplete Danish road network.
problem Incomplete speed limit data on Danish roads limits machine learning applications.
method Applied node2vec network embedding to Danish road network.
result Network embedding can derive useful features for predicting speed limits.
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.
New approach learns latent motifs in networks for mesoscale structure analysis.
problem Understanding large-scale behavior in complex systems through mesoscale structures.
method Network dictionary learning (NDL) combining network sampling and nonnegative matrix factorization.
result Networks can be approximated using a small set of latent motifs.