SOCR JMM 2023
Revision as of 16:21, 21 June 2022 by Dinov (talk | contribs) (Created page with "== SOCR News & Events: 2023 JMM/AMS Special Session on ''Tensor Representation, Completion, Modeling and Analytics of Complex Data'' == Image:BigData_AMS_JM...")
SOCR News & Events: 2023 JMM/AMS Special Session on Tensor Representation, Completion, Modeling and Analytics of Complex Data
- Ivo Dinov, University of Michigan, SOCR, MIDAS.
- [ Joshual Welch], University of Michigan, SOCR, MIDAS
- Venue: Hynes Convention Center, Room 206.
- Registration: Meeting Registration is required.
- Zoom: Zoom URL links to all sessions, access requires JMM 2021 Registration.
- Conference: 2021 Joint Mathematics Meetings Meeting.
- Session Format: 4-hour session, 8 20+5+5 minute talks.
- Equipment: Computer projector and screen with HDMI connection only (no VGA!) Session room does not include overhead transparency projectors, computers/laptops, blackboards or whiteboards.
- AMS Special Session Manual: AMS/JMM Session Manual.
- Paper Abstract Submission - choose session SS 9A (due date: Sept 15, 2020).
- COVID-19 Updates: AMS Resources & Updates related to COVID-19.
- Session URL: https://myumi.ch/qgRl1.
|Time US MT timezone (GMT-7)||Presenter/Affiliation||Title||Abstract ID|
|8:00AM||Caroline Uhler (MIT)||Multi-Domain Data Integration: From Observations to Mechanistic Insights||Abstract 1163-62-32|
|8:30AM||Mehmet (Memo) Dalkilic (Indiana University)||Teaching an Old Dog New Tricks: Making EM work with Big Data using Heaps||Abstract 1163-03-86|
|9:00AM||Tom Needham (Florida State University)||Applications of Gromov-Wasserstein distance to network science||Abstract 1163-52-68|
|9:30AM||Jeff M. Phillips (Utah)||A Primer on the Geometry in Machine Learning||Abstract 1163-52-52|
|10:00AM||Jonathan Niles-Weed, NYU/Courant/Center for Data Science||Statistical estimation under group actions||Abstract 1163-62-41|
|10:30 AM||Adrian Barbu (Florida State University)||A Novel Framework for Online Supervised Learning with Feature Selection||Abstract 1163-62-50|
|11:00 AM||Maxime G Pouokam (UC Davis)||Statistical Topology of Genome Analysis in Three Dimensions||Abstract 1163-62-338|
|11:30 AM||Ivo D. Dinov (University of Michigan)||Data Science, Time Complexity, and Spacekime Analytics||Abstract 1163-62-33|
Speakers, Titles, and Abstracts
- Caroline Uhler (MIT): Multi-Domain Data Integration: From Observations to Mechanistic Insights (Abstract 1163-62-32)
- Massive data collection holds the promise of a better understanding of complex phenomena and ultimately, of better decisions. An exciting opportunity in this regard stems from the growing availability of perturbation / intervention data (manufacturing, advertisement, education, genomics, etc.). In order to obtain mechanistic insights from such data, a major challenge is the integration of different data modalities (video, audio, interventional, observational, etc.). Using genomics and in particular the problem of identifying drugs for the repurposing against COVID-19 as an example, I will first discuss our recent work on coupling autoencoders in the latent space to integrate and translate between data of very different modalities such as sequencing and imaging. I will then present a framework for integrating observational and interventional data for causal structure discovery and characterize the causal relationships that are identifiable from such data. We end by a theoretical analysis of autoencoders linking overparameterization to memorization. In particular, I will characterize the implicit bias of overparameterized autoencoders and show that such networks trained using standard optimization methods implement associative memory. Collectively, our results have major implications for planning and learning from interventions in various application domains.
- Mehmet (Memo) Dalkilic (Indiana University): Teaching an Old Dog New Tricks: Making EM work with Big Data using Heaps (Abstract 1163-03-86)
- Contemporary data mining algorithms are easily overwhelmed with truly big data. While parallelism, improved initialization, and ad hoc data reduction are commonly used and necessary strategies, we note that (1) continually revisiting data and (2) visiting all data are two of the most prominent problems–especially for iterative learning techniques like expectation-maximization algorithm for clustering (EM-T). To the best of our knowledge, there is no freely available software that specifically focuses on improving the original EM-T algorithm in the context of big data. We demonstrate the utility of CRAN package DCEM that implements an improved version of EM-T, which we call EM* (EM star). DCEM provides an integrated and minimalistic interface to EM-T and EM* algorithms, and can be used as either (1) a stand-alone program or (2) a pluggable component in existing software. We show that EM* can both effectively and efficiently cluster data as we vary size, dimensions, and separability.
- Tom Needham (Florida State University): Applications of Gromov-Wasserstein distance to network science (Abstract 1163-52-68)
- Recent years have seen a surge of research activity in network analysis through the lens of optimal transport. This perspective boils down to the following simple idea: when comparing two networks, instead of considering a traditional registration between their nodes, one instead searches for an optimal ‘soft’ or probabilistic correspondence. This perspective has led to state-of-the-art algorithms for robust large-scale network alignment and network partitioning tasks. A rich mathematical theory underpins this work: optimal node correspondences realize the Gromov-Wasserstein (GW) distance between networks. GW distance was originally introduced, independently by K. T. Sturm and Facundo M ́emoli, as a tool for studying abstract convergence properties of sequences of metric measure spaces. In particular, Sturm showed that GW distance can be understood as a geodesic distance with respect to a Riemannian structure on the space of isomorphism classes of metric measure spaces (the ‘Space of Spaces’). In this talk, I will describe joint work with Samir Chowdhury,in which we develop computationally efficient implementations of Sturm’s ideas for network science applications. We also derive theoretical results which link this framework to classical notions from spectral network analysis.
- Jeff M. Phillips (Utah): A Primer on the Geometry in Machine Learning (Abstract 1163-52-52)
- Machine Learning is a discipline filled with many simple geometric algorithms, the central task of which is usually classification. These varied approaches all take as input a set of n points in d dimensions, each with a label. In learning,the goal is to use this input data to build a function which predicts a label accurately on new data drawn from the same unknown distribution as the input data. The main difference in the many algorithms is largely a result of the chosen class of functions considered. This talk will take a quick tour through many approaches from simple to complex and modern,and show the geometry inherent at each step. Pit stops will include connections to geometric data structures, duality,random projections, range spaces, and core sets.
- Jonathan Niles-Weed, NYU/Courant/Center for Data Science: Statistical estimation under group actions (Abstract 1163-62-41)
- A common challenge in the sciences is the presence of heterogeneity in data. Motivated by problems in signal processing and computational biology, we consider a particular form of heterogeneity where observations are corrupted by random transformations from a group (such as the group of permutations or rotations) before they can be collected and analyzed. We establish the fundamental limits of statistical estimation in such settings and show that the optimal rates of recovery are precisely governed by the invariant theory of the group. As a corollary, we establish rigorously the number of samples necessary to reconstruct the structure of molecules in cryo-electron microscopy. We also give a computationally efficient algorithm for a special case of this problem, and discuss conjectured statistical-computational gaps for the general case.
- Based on joint work with Afonso Bandeira, Ben Blum-Smith, Joe Kileel, Amelia Perry, Philippe Rigollet, Amit Singer, and Alex Wein.
- Adrian Barbu (Florida State University): A Novel Framework for Online Supervised Learning with Feature Selection (Abstract 1163-62-50)
- Current online learning methods suffer from lower convergence rates and limited capability to recover the support of the true features compared to their offline counterparts. In this work, we present a novel online learning framework based on running averages and introduce online versions of some popular existing offline methods such as Elastic Net, Minimax Concave Penalty and Feature Selection with Annealing. The framework can handle an arbitrarily large number of observations as long as the data dimension is not too large, e.g. p<50,000. We prove the equivalence between our online methods and their offline counterparts and give theoretical true feature recovery and convergence guarantees for some of them. In contrast to the existing online methods, the proposed methods can extract models of any sparsity level at any time. Numerical experiments indicate that our new methods enjoy high accuracy of true feature recovery and a fast convergence rate, compared with standard online and offline algorithms. We also show how the running averages framework can be used for model adaptation in the presence of model drift. Finally, we present applications to large datasets where again the proposed framework shows competitive results compared to popular online and offline algorithms.
- Maxime G Pouokam (UC Davis): Statistical Topology of Genome Analysis in Three Dimension (Abstract 1163-62-338)
- The three-dimensional (3D) configuration of chromosomes within the eukaryote nucleus is an important factor for several cellular functions, including gene expression regulation, and has also been linked with many diseases such as cancer-causing translocation events. Recent adaptations of high-throughput sequencing to chromosome conformation capture (3C) techniques, allows for genome-wide structural characterization for the first time with a goal of getting a 3D structure of the genome. In this study, we present a novel approach to compute entanglement in open chains in general and apply it to chromosomes. Our metric is termed the linking proportion (Lp). We use the Lp in two different settings. We use the Lp to show that the Rabl configuration, an evolutionary conserved feature of the 3D nuclear organization, as an essential player in the simplification of the entanglement of chromatin fibers. We show how the Lp incorporates statistical models of inference that can be used to determine the agreement between candidate 3D configuration reconstructions. In the last part of our work, we present Smooth3D, a novel 3D genome reconstruction method via cubic spline approximation.
- Ivo D. Dinov (University of Michigan): Data Science, Time Complexity, and Spacekime Analytics (Abstract 1163-62-33)
- Human behavior, communication, and social interactions are profoundly augmented by the rapid immersion of digitalization and virtualization of all life experiences. This process presents important challenges of managing, harmonizing, modeling, analyzing, interpreting, and visualizing complex information. There is a substantial need to develop, validate, productize, and support novel mathematical techniques, advanced statistical computing algorithms, transdisciplinary tools, and effective artificial intelligence applications. Spacekime analytics is a new technique for modeling high-dimensional longitudinal data. This approach relies on extending the notions of time, events, particles, and wavefunctions to complex-time (kime), complex-events (kevents), data, and inference-functions. We will illustrate how the kime-magnitude (longitudinal time order) and kime-direction (phase) affect the subsequent predictive analytics and the induced scientific inference. The mathematical foundation of spacekime calculus reveal various statistical implications including inferential uncertainty and a Bayesian formulation of spacekime analytics. Complexifying time allows the lifting of all commonly observed processes from the classical 4D Minkowski spacetime to a 5D spacekime manifold, where a number of interesting mathematical problems arise. Direct data science applications of spacekime analytics will be demonstrated using simulated data and clinical observations (e.g., sMRI, fMRI data).
- (Adrian Barbu) A Novel Framework for Online Supervised Learning with Feature Selection.
- (Maxime Pouokam) Statistical Topology of Genome Analysis in Three Dimension.
- (Ivo Dinov) Data Science, Time Complexity, and Spacekime Analytics (Presentation Slides).
Translate this page: