Proposes a method to optimize budget allocation for collecting and analyzing streaming data.
problem Optimizing resource allocation for collecting and analyzing streaming data.
method Formulates optimization problems to allocate budgets for collecting input data and running simulations, characterizes asymptotic behavior of performance estimators, and develops a multi-stage simultaneous budget allocation procedure.
result Demonstrates competitive performance of the proposed procedure through numerical studies.
In most real-world settings such as recommender systems, finance, and healthcare, collecting useful information is costly and requires an active choice on the part of the decision maker. The decision-maker needs to learn simultaneously what observations to make and what actions to take. This paper incorporates the info…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of quasimorphisms on hyperbolically embedded subgroups that can be to simultaneously extended to…
Generative model learns conditional distributions on collective variable levels.
problem Modeling conditional probability distributions on collective variable levels.
method General and efficient learning approach, data enrichment strategy.
result Effective generative models on different level-sets of collective variables.
Learning by integrating multiple heterogeneous data sources is a common requirement in many tasks. Collective Matrix Factorization (CMF) is a technique to learn shared latent representations from arbitrary collections of matrices. It can be used to simultaneously complete one or more matrices, for predicting the unknow…
The analysis of observed conditional distributions of both lagged and simultaneous intraday price increments of a basket of stocks reveals phenomena of dependence - induced volatility smile and kurtosis reduction. A model based on multivariate t-Student distribution shows that the observed effects are caused by colelct…
New tool helps classify invariant subvarieties in degenerations.
problem Classifying invariant subvarieties in degenerations.
method Introducing diamonds of GL(2,R)-invariant subvarieties.
result Classified a rich collection of diamonds.
In recent years, there has been a growing interest in identifying anomalous structure within multivariate data streams. We consider the problem of detecting collective anomalies, corresponding to intervals where one or more of the data streams behaves anomalously. We first develop a test for a single collective anomaly…
Relational learning deals with data that are characterized by relational structures. An important task is collective classification, which is to jointly classify networked objects. While it holds a great promise to produce a better accuracy than non-collective classifiers, collective classification is computational cha…
Scaffolding sets improve predictor correctness across subsets.
problem Ensuring predictor correctness across multiple subsets.
method Inspired by neural nets, constructing scaffolding sets to ensure correctness.
result Scaffolding sets ensure predictor correctness, not just calibration.
Simultaneously recorded electroencephalography (EEG) and functional magnetic resonance imaging (fMRI) can be used to non-invasively measure the spatiotemporal dynamics of the human brain. One challenge is dealing with the artifacts that each modality introduces into the other when the two are recorded concurrently, for…
AutoEncoder smooths noisy sensor data and interpolates missing values.
problem Noisy sensor data and missing timepoints require interpolation.
method Uses AutoEncoder to denoise and interpolate data.
result AutoEncoder improves data quality and reveals dynamics.
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
Proposes methods to recover labels from shuffled networks using graph averages.
problem Recovering labels from a shuffled network using graph averages.
method Cluster networks into classes, then match the new graph to cluster-averages, minimizing the graph matching objective function.
result Higher fidelity matching performance when clustering networks into different classes.
Macromolecular and biomolecular folding landscapes typically contain high free energy barriers that impede efficient sampling of configurational space by standard molecular dynamics simulation. Biased sampling can artificially drive the simulation along pre-specified collective variables (CVs), but success depends crit…
In open set recognition (OSR), almost all existing methods are designed specially for recognizing individual instances, even these instances are collectively coming in batch. Recognizers in decision either reject or categorize them to some known class using empirically-set threshold. Thus the decision threshold plays a…
The MIMIC-CXR dataset is (to date) the largest released chest x-ray dataset consisting of 473,064 chest x-rays and 206,574 radiology reports collected from 63,478 patients. We present the results of training and evaluating a collection of deep convolutional neural networks on this dataset to recognize multiple common t…
New algorithms for batch decision-making with high-dimensional user data.
problem Maximizing treatment efficacy in groups of users.
method Teamwork LASSO Bandit algorithm, switching between teamwork and selfish stages.
result Upper bound on expected cumulative regret for the proposed algorithm.
Distributed machine learning (ML) is a modern computation paradigm that divides its workload into independent tasks that can be simultaneously achieved by multiple machines (i.e., agents) for better scalability. However, a typical distributed system is usually implemented with a central server that collects data statis…
Study shows universal circles for taut foliations in 3-manifolds.
problem Understanding foliations in 3-manifolds.
method Analyzes pseudo-Anosov flows and taut foliations, defines universal circles.
result Action of pi_1(M) on flow space defines universal circles for taut foliations.
This paper extends some results of Hatcher and Quinn beyond the metastable range. We give a bordism theoretic obstruction to deforming a map between manifolds simultaneously off of a collection of pairwise disjoint submanifolds under the assumption that it can be deformed off of any proper subcollection in a homotopy c…
Study of laminations for pseudo-Anosov flows on three-manifolds.
problem Understanding laminations for pseudo-Anosov flows on three-manifolds.
method Analyzing laminations Λu± for pseudo-Anosov orbit space universal circles, using prelaminations and results from Barthelmé, Bonatti, and Mann. result Laminations Λu+ and Λu− are completely determined by prelaminations on the boundary of the orbit space. Our problem of interest is to cluster vertices of a graph by identifying underlying community structure. Among various vertex clustering approaches, spectral clustering is one of the most popular methods because it is easy to implement while often outperforming more traditional clustering algorithms. However, there are…
To address potential gaps noted in patient monitoring in the hospital, a novel patient behavior detection system using mmWave radar and deep convolution neural network (CNN), which supports the simultaneous recognition of multiple patients' behaviors in real-time, is proposed. In this study, we use an mmWave radar to t…
This paper proposes a new method for financial portfolio optimization based on reducing simultaneous asset shocks across a collection of assets. This may be understood as an alternative approach to risk reduction in a portfolio based on a new mathematical quantity. First, we apply recently introduced semi-metrics betwe…
Proposes deep collective learning to learn inputs and weights together in neural networks.
problem The need to optimize inputs alongside weights in deep neural networks.
method Introduces deep collective learning to learn inputs and weights jointly, using lookup tables.
result Demonstrates advantages and promise of Lookup-VNets and deep collective learning.
Clarinet uses complementary labels to train classifiers with less source data.
problem Training classifiers with true-label data from source domain is costly.
method Proposes CLARINET to train classifiers with complementary-label source data and unlabeled target data.
result CLARINET significantly outperforms baselines in unsupervised domain adaptation.
Adaptive methods learn from multiple datasets, leveraging similarities and robust to outliers.
problem Simultaneously analyze multiple datasets with possible similarities and differences.
method Adaptive multi-task learning methods that automatically utilize similarities and handle differences.
result Sharp statistical guarantees and robustness against outlier tasks demonstrated.
In this work, we propose a simple model that provides permutation invariant maximally predictive prototype generator from a given dataset, which leads to interpretability of the solution and concrete insights to the nature and the solution of a problem. Our aim is to find out prototypes in the feature space to map the …
In several application domains, high-dimensional observations are collected and then analysed in search for naturally occurring data clusters which might provide further insights about the nature of the problem. In this paper we describe a new approach for partitioning such high-dimensional data. Our assumption is that…
In neuroimaging data analysis, Gaussian graphical models are often used to model statistical dependencies across spatially remote brain regions known as functional connectivity. Typically, data is collected across a cohort of subjects and the scientific objectives consist of estimating population and subject-specific g…
We provide single-model estimates of aleatoric and epistemic uncertainty for deep neural networks. To estimate aleatoric uncertainty, we propose Simultaneous Quantile Regression (SQR), a loss function to learn all the conditional quantiles of a given target variable. These quantiles can be used to compute well-calibrat…
The paper proposes a new algorithm for the high-dimensional financial data -- the Groupwise Interpretable Basis Selection (GIBS) algorithm, to estimate a new Adaptive Multi-Factor (AMF) asset pricing model, implied by the recently developed Generalized Arbitrage Pricing Theory, which relaxes the convention that the num…
We study simultaneous price drops of real stocks and show that for high drop thresholds they follow a power-law distribution. To reproduce these collective downturns, we propose a minimal self-organized model of cascade spreading based on a probabilistic response of the system elements to stress conditions. This model …
Develops scenario theory for multi-criteria decision making.
problem Need for robustness assessment with multiple criteria and datasets.
method Collectively treats risks associated with individual criteria for multi-criteria decision problems.
result More accurate robustness certificates and sharper quantification of simultaneous criterion satisfaction.
During the fabrication of casting parts sensor data is typically automatically recorded and accumulated for process monitoring and defect diagnosis. As casting is a thermal process with many interacting process parameters, root cause analysis tends to be tedious and ineffective. We show how a decomposition based on non…
Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with …
Unified model combines neural networks and dictionary learning for clinical predictions from brain data.
problem Predicting clinical severity from brain imaging data.
method Combines neural networks with dictionary learning to model patient-specific and shared features.
result Unified model outperforms state-of-the-art methods in predicting clinical severity.
Model clusters networks and their communities simultaneously.
problem Clustering networks and their communities in unlabeled, heterogeneous networks.
method Nested Stochastic Block Model (NSBM) with Bayesian approach and NDP prior.
result Model accurately estimates both within and across network clustering structures.
This work is done as part of a master's thesis project. The increase in the volume of data has given rise to various issues related to the collection, storage, analysis and exploitation of these data in order to create an added value. In this master, we are interested in the search of frequent closed patterns in the tr…
Scientific investigations that incorporate next generation sequencing involve analyses of high-dimensional data where the need to organize, collate and interpret the outcomes are pressingly important. Currently, data can be collected at the microbiome level leading to the possibility of personalized medicine whereby tr…
There is a widely-accepted need to revise current forms of health-care provision, with particular interest in sensing systems in the home. Given a multiple-modality sensor platform with heterogeneous network connectivity, as is under development in the Sensor Platform for HEalthcare in Residential Environment (SPHERE) …
Cyclic Data Parallelism reduces memory usage and balances gradient communications.
problem Training large deep learning models requires efficient parallelism to scale.
method Cyclic Data Parallelism shifts micro-batches from simultaneous to sequential execution, balancing memory and gradient communications.
result Cyclic Data Parallelism reduces total memory usage and balances gradient communications.
Federated learning is an emerging technique used to prevent the leakage of private information. Unlike centralized learning that needs to collect data from users and store them collectively on a cloud server, federated learning makes it possible to learn a global model while the data are distributed on the users' devic…
Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption that instances of the same class link to each other (assortativity assumption).…
CMF is a technique for simultaneously learning low-rank representations based on a collection of matrices with shared entities. A typical example is the joint modeling of user-item, item-property, and user-feature matrices in a recommender system. The key idea in CMF is that the embeddings are shared across the matrice…
The question of how to stabilize financial systems has attracted considerable attention since the global financial crisis of 2007-2009. Recently, Beale et al. ("Individual versus systemic risk and the regulator's dilemma", Proc Natl Acad Sci USA 108: 12647-12652, 2011) demonstrated that higher portfolio diversity among…
Robots learn new tasks autonomously with minimal human intervention.
problem Lack of scalable data collection for robot learning.
method Multi-task imitation learning with autonomous data collection and one-shot generalization.
result Robots can continuously improve through autonomous data collection without reinforcement learning.