Abstract: Sub-grid turbulence is challenging to resolve in climate models; therefore, it is parameterized. Traditionally, turbulent parameterizations have relied on physics-based and equation-based approaches. However, ad hoc and uncertain components in these parameterizations introduce uncertainty in future climate predictions. Recently, data-driven techniques have emerged as an alternative for modeling sub-grid fluxes. I will demonstrate the use of machine learning to model vertical turbulent fluxes in the ocean surface boundary layer and its impact on reducing biases in NOAA's Geophysical Fluid Dynamics Laboratory ocean climate model.

I will show how neural networks, trained to predict the eddy diffusivity profile from high-fidelity yet computationally expensive turbulence schemes, enhance the vertical mixing scheme in the climate model. These networks replace ad hoc components while maintaining the conservation principles of the standard ocean model equations. The enhanced scheme outperforms its predecessor by reducing biases in the mixed-layer depth and modestly improving tropical upper-ocean stratification in ocean-only global simulations. Furthermore, simplified equations that can replace the neural networks show similar improvements but with lower computational cost and better interpretability. They point to structural deficiencies in the baseline parameterization. This work is one of the first successful applications of machine learning to improve a sub-grid parameterization of turbulent mixing in ocean climate models.

IACS Seminar Speaker: Aakash Sane, Princeton University

Location: IACS Seminar Room or Zoom

Join Zoom Meeting: https://stonybrook.zoom.us/j/97764942108?pwd=MzCWupCe3L9mKdrgfO2bJg3GBbvXuf.1
Meeting ID: 977 6494 2108
Passcode: 519324


The International Conference on Learning Representations (ICLR) is the premier gathering of professionals dedicated to the advancement of the branch of artificial intelligence called representation learning, but generally referred to as deep learning.



ICLR is globally renowned for presenting and publishing cutting-edge research on all aspects of deep learning used in the fields of artificial intelligence, statistics and data science, as well as important application areas such as machine vision, computational biology, speech recognition, text understanding, gaming, and robotics.

ICLR is one of the fastest growing artificial intelligence conferences in the world. Participants at ICLR span a wide range of backgrounds, from academic and industrial researchers, to entrepreneurs and engineers, to graduate students and postdocs.

The rapidly developing field of deep learning is concerned with questions surrounding how we can best learn meaningful and useful representations of data. ICLR takes a broad view of the field and includes topics such as feature learning, metric learning, compositional modeling, structured prediction, reinforcement learning, and issues regarding large-scale learning and non-convex optimization.

A non-exhaustive list of relevant topics explored at the conference include:



  • Unsupervised, Semi-supervised, and Supervised Representation Learning
  • Representation Learning for Planning and Reinforcement Learning
  • Metric Learning and Kernel Learning
  • Sparse Coding and Dimensionality Expansion
  • Hierarchical Models

  • Optimization for Representation Learning
  • Learning Representations of Outputs or States
  • Implementation Issues, Parallelization, Software Platforms, Hardware
  • Applications in Vision, Audio, Speech, Natural Language Processing, Robotics, Neuroscience, or Any Other Field


For more information or registration, please visit the official website.
Communication-Efficient Heterogeneity-Aware Machine Learning System and Architecture by Xuehai Qian

ABSTRACT: The key success of deep learning is the increasing size of models that can achieve high accuracy. At the same time, it is difficult to train the complex models with large data sets. Therefore, it is crucial to accelerate training with distributed systems and architectures, where communication and heterogeneity are two key challenges. In this talk, I will present two heterogeneity-aware decentralized training protocols without communication bottleneck. Specifically, Hop supports arbitrary iteration gap between workers by novel queue-based synchronization which can tolerate heterogeneity with system techniques. Prague uses randomized communication to tolerate heterogeneity with a new training algorithm based on partial reduce -- an efficient communication primitive. If time permits, I will present the systematic tensor partitioning for training on heterogeneous accelerator arrays (e.g., GPU/TPU). We believe that our principled approaches are crucial for achieving high-performance and efficient distributed training.

BIO: Xuehai Qian is an assistant professor at University of Southern California. His research interests include domain-specific systems and architectures, performance tuning and resource management of cloud systems and parallel computer architectures. He received his PhD from the University of Illinois Urbana Champaign and was a postdoc at UC Berkeley. He is the recipient of W.J Poppelbaum Memorial Award at UIUC, NSF CRII and CAREER Award, and the inaugural ACSIC (American Chinese Scholar In Computing) Rising Star Award.
Abstract: Visual generation is a fundamental problem in computer vision and graphics, with applications ranging from 3D capture to image and video synthesis. Despite rapid progress in neural rendering and generative models, efficiency remains a key bottleneck: high-quality 3D reconstruction often relies on dense multi-view supervision; high-fidelity 3D synthesis requires costly optimization, training, and rendering; and modern image and video generators require substantial computation as the number of tokens grows rapidly for high-resolution generation. This dissertation focuses on efficient visual generation by improving sample efficiency in 3D reconstruction, representation efficiency in 3D generation, and computational efficiency in image and video synthesis. First, we improve the sample efficiency of neural implicit surface reconstruction. We integrate multi-view stereo probability volumes as a geometric regularizer, enabling high-quality sparse-view reconstruction from as few as three input images. Next, we introduce an explicit 3D representation for 3D generation, built from multi-view depth and RGB images with 3D Gaussian features. This design allows the model to use 2D generative priors while enforcing multi-view consistency through epipolar attention. We then address the computational bottleneck in image and video synthesis with importance-based token merging. Our method uses importance signals available during generation to preserve critical information while merging redundant tokens. Finally, we enable efficient mixed-resolution diffusion transformers via phase-aligned attention. This approach stabilizes attention under mixed-resolution token grids and unlocks high-fidelity image and video generation at reduced cost. Taken together, these contributions reduce the data requirements, representational overhead, and computational demands, thereby providing a foundation for high-quality, scalable, and efficient visual generation.

Speaker: Haoyu Wu

Location: NCS 120

Join Klaus Mueller, professor of computer science and interim chair of the Department of Technology and Society, as he hosts Sucheta Lahiri.

Lahiri leads the AI Ethics and Risk Management function at Oxy, where she is responsible for ensuring that the company's AI solutions are developed and deployed in a manner that is ethical, efficient, trustworthy, safe, sustainable, and human-centered. She holds a doctorate from Syracuse University, along with two master's degrees in Applied Statistics and Information Science earned in India.

Zoom: https://stonybrook.zoom.us/j/7851507944?omn=98268154363#success

What AI tools are available to help with the scholarly research process? Are they helpful? What do they do and is it worth the time and energy to try them out? Join librarian Christine Fena to explore and compare established and emerging AI research tools such as Elicit, Scite, Consensus, and Undermind. The workshop will not offer a lengthy tutorial on how to use any of these tools, but will provide a starting point to understanding what they are, what new ones are emerging, and how AI research assistants might bring changes to your search process. All are welcome!

Register for this Zoom workshop.

Abstract: Datalog is a powerful language for expressing recursive computations through rules: Horn clauses in first order logic. Although effective at expressing queries over existential properties, Datalog and many of its popular implementations struggle with queries that involve more complex aggregates, requiring users to apply verbose, non-composable, and/or inefficient workarounds. Recent work on lattice-based datalogs addresses many of these concerns for aggregates that can be encoded as lattices (e.g., min or max), but more general aggregates like count remain problematic. In this talk, I will argue that this is not a fundamental limitation of Datalog, but rather from its model of truth: Both datalog semantics and evaluation rules make heavy use of the fact that insertion is both monotone and idempotent. Once a fact is known to be true, it can not be retracted, nor can further discoveries of the same fact alter its truth. Monotonicity is critical for forward progress under Datalog's ``open world'' model, as it allows us to safely assert the truth of a body. Meanwhile, idempotence makes it easier to reason about evaluation, as we need only guarantee that each head atom will be derived at-least-once. Unfortunately, more general aggregates like sum() are neither idempotent, nor monotone. I will introduce Hedgelog, a strict generalization of Datalog that uses general monoids as a basis for truth. I will show that this generalization remains compatible with Datalog's open world model, how it enables cleaner and more composable datalog programs, and how the underlying monoid relations open the door to interesting datastructure-level optimizations.

Bio: Oliver Kennedy is an associate professor at the University at Buffalo. He earned his PhD from Cornell University in 2011 and now leads the Online Data Interactions (ODIn) lab, which operates at the intersection of databases and programming languages. Oliver is the recipient of an NSF CAREER award, an IEEE Region 1 Technological Innovation Award, UB's Exceptional Scholar Award, and several UB SEAS teaching awards. Oliver is also one of the founding board members of Breadcrumb Analytics. Several of Oliver's papers have been invited to Best of compilations from SIGMOD and VLDB. The ODIn lab is currently exploring (i) how we can leverage database techniques like incremental view maintenance to make compilers faster, (ii) how to make it easier for data scientists to track how sources of uncertainty, ambiguity, and/or bias affect analyses, and (iii) how to streamline the interfaces --- both human and software --- between different tools for data science, like python, sql, and spreadsheets.

Location: NCS 120