Seminars

The AROMATH seminar will usually happen on Tuesday at 10h30-11h30 every two weeks, except for a few deviations.
The presentations will typically take place at Inria Sophia Antipolis, Byron Blanc 106, and also online.
To join online, at https://cutt.ly/aromath or with a web browser at https://cutt.ly/aromath-web
use meeting ID: 828 5859 7791, passcode: 123

Events in April–September 2023

  • - Matthias Möller (TU Delft) - IgaNets: Physics-Informed Machine Learning Embedded Into Isogeometric Analysis
    Matthias Möller (TU Delft) - IgaNets: Physics-Informed Machine Learning Embedded Into Isogeometric Analysis

    Category: General Matthias Möller (TU Delft) - IgaNets: Physics-Informed Machine Learning Embedded Into Isogeometric Analysis

    10h0-11h0
    25 April 2023

    Many engineering problems of practical interest are modelled by systems of partial differential equations equipped with initial and boundary conditions and complemented by problem-specific constitutive laws. For decades, numerical methods like the finite element method have been the method of choice for computing approximate solutions to problems that cannot be solved analytically. Starting with the seminal paper [1] on physics-informed neural networks a new paradigm has entered the stage: learning the behavior of the problem instead of discretizing it and solving the resulting linear(ized) systems of equations brute-force. Several alternative approaches like DeepONets [2] and Fourier neural networks [3] have been proposed in recent years. Their ease of implementation and fast response time, once training is completed, makes learning-based methods particularly attractive for engineering applications as they offer the opportunity to explore many different designs without costly simulation.

    In this talk we propose a novel approach to embed the physics-informed machine learning paradigm into the framework of Isogeometric Analysis (IGA) to combine the best of both worlds. In contrast to other learning-based approaches, which predict point-wise solution values to (initial-)boundary-value problems directly, our IgaNets [4] learn solutions in terms of their expansion coefficients relative to a given B-Spline or NURBS basis. This approach is furthermore used to encode the geometry and other problem parameters such as boundary conditions and parameters of the constitutive laws and feed them into the feed-forward neural network as inputs. Once trained, our IgaNets make it possible to explorer various designs from a family of similar problem configurations efficiently without the need to perform a computationally expensive simulation for each new problem configuration. Next to discussing the method conceptually and presenting numerical results, we will shed some light on the technical details. In particular, we will discuss a matrix-based implementation of B-splines that is particularly suited for efficient backpropagation. We will furthermore present a first prototype of a web-browser-based frontend for showcasing interactive design-through-analysis workflows.

    REFERENCES
    [1] M. Raissi, P. Perdikaris, and G.E. Karniadakis. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations. Comput. Phys., Vol. 378, pp. 686-707, 2019.
    [2] L. Lu, P. Jin, G. Pang, Z. Zhang, and G.E. Karniadakis. Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators. Nat Mach Intell, Vol. 3, pp. 218-229, 2021.
    [3] Z. Li, N. Kovachki, K. Azizzadenesheli, B. Liu, K. Bhattacharya, A. Stuart, and A.
    Anandkumar. Fourier neural operator for parametric partial differential equations. arXiv:2010.08895
    [4] M. Möller, D. Toshniwal, F. van Ruiten. Physics-informed machine learning embedded into isogeometric analysis. In: Mathematics: Key enabling technology for scientific machine.

    Salle Byron Blanc (Y106), Inria
  • - B. Nkonga (CASTOR) -- The spring of magnetic fusion energy: Issues and challenges in the context of AI
    B. Nkonga (CASTOR) -- The spring of magnetic fusion energy: Issues and challenges in the context of AI

    Category: Conference B. Nkonga (CASTOR) -- The spring of magnetic fusion energy: Issues and challenges in the context of AI

    10h30-11h30
    3 May 2023

    B. Nkonga (CASTOR) -- The spring of magnetic fusion energy: Issues and challenges in the context of AI

    This presentation outlines strategies to achieve fusion over long time scales successfully. The aim is to develop fusion reactors capable of powering the electrical grid. These societal objectives pose several industrial, technical, and scientific challenges. We also have many experimental results on tokamaks like JET, which contain specific knowledge that is only sometimes well exploited. In this field, AI can be a handy tool in a scientific environment where numerical simulation plays a significant role.


    Salle Byron Blanc (Y106), Inria
  • - Vinay Kumar (NEO) -- Community detection on multilayer hypergraphs using the aggregate similarity matrix
    Vinay Kumar (NEO) -- Community detection on multilayer hypergraphs using the aggregate similarity matrix

    Category: General Vinay Kumar (NEO) -- Community detection on multilayer hypergraphs using the aggregate similarity matrix

    10h30-11h30
    10 May 2023

    Vinay Kumar (NEO) -- Community detection on multilayer hypergraphs using the aggregate similarity matrix

    We consider the community recovery problem on a multilayer variant of the hypergraph stochastic block model (HSBM). Each layer is associated with an independent realization of a d-uniform HSBM on N vertices. Given the aggregated number of hyperedges incident on each pair of vertices, represented using a similarity matrix, the goal is to obtain a partition of the N vertices into two disjoint communities. In this talk, we investigate a semidefinite programming (SDP) approach to recover the communities. A dual certificate strategy for the SDP problem is employed to obtain information-theoretic conditions on the model parameters that guarantee exact recovery both in the assortative and the disassortative cases.

     

    Salle Byron Beige (Y506), Inria
  • - Angelos Mantzaflaris (AROMATH) -- Problems session in optics
    Angelos Mantzaflaris (AROMATH) -- Problems session in optics

    Category: General Angelos Mantzaflaris (AROMATH) -- Problems session in optics

    10h30-11h30
    24 May 2023

    Salle Byron Blanc (Y106), Inria
  • - Meng Wu (Nanjing University of Science and Technology, China) -- Surface mesh generation of CAD models based on nontrivial metrics
    Meng Wu (Nanjing University of Science and Technology, China) -- Surface mesh generation of CAD models based on nontrivial metrics

    Category: General Meng Wu (Nanjing University of Science and Technology, China) -- Surface mesh generation of CAD models based on nontrivial metrics

    11h00-12h00
    23 June 2023

    Meng Wu (Nanjing University of Science and Technology, China) -- Surface mesh generation of CAD models based on nontrivial metrics

    In this talk, we present a framework to generate an analysis suitable triangular mesh of CAD models.
    By introducing nontrivial metrics, Constrained Delaunay Triangulation (CDT) and Laplacian smoothing are computed on its parametric domains
    instead of computing them on surfaces directly.

    Salle Byron Beige (Y506), Inria
  • - Venkat Chandrasekaran (CALTECH, US) -- Signomial and Polynomial Optimization via Relative Entropy Relaxations
    Venkat Chandrasekaran (CALTECH, US) -- Signomial and Polynomial Optimization via Relative Entropy Relaxations

    Category: General Venkat Chandrasekaran (CALTECH, US) -- Signomial and Polynomial Optimization via Relative Entropy Relaxations

    14h00-15h00
    28 June 2023

    Venkat Chandrasekaran (CALTECH, US) -- Signomial and Polynomial Optimization via Relative Entropy Relaxations

    We describe how relative entropy is uniquely suited for optimization of signomials and sparse polynomials. The particular approach is by way of nonnegativity certificates based on the arithmetic-geometric inequality, and it connects to results by Descartes (the rule of signs) and Khovanskii (the theory of fewnomials). The facial structure of the underlying Newton polytopes plays a prominent role in our analysis. Our results have consequences in two directions. In one direction, we highlight the utility of the signomial perspective for sparse polynomial optimization. In the other direction, signomials represent a natural generalization of polynomials for which Newton polytopes continue to yield valuable insights. Our techniques provide an exponential runtime improvement on the state-of-the-art for high-degree polynomial optimization, and lead to a "Hilbert table" for signomial (and sparse polynomial) nonnegativity. [Joint with Riley Murray, Parikshit Shah, and Adam Wierman.]

    Salle Byron Blanc (Y106), Inria
  • - Hamid Hassanzadeh (Mathematics Institute, Federal University of Rio de Janeiro) -- An Algebraic Study of Bir(X)
    Hamid Hassanzadeh (Mathematics Institute, Federal University of Rio de Janeiro) -- An Algebraic Study of Bir(X)

    Category: General Hamid Hassanzadeh (Mathematics Institute, Federal University of Rio de Janeiro) -- An Algebraic Study of Bir(X)

    10h30-11h30
    18 September 2023

    Let X be a projective variety. In this talk, we explain some of the difficulties of studying the group of birational maps over X  in comparison with those over \mathbb{P}^n.
    We define the concept of birational maps of clear polynomial degree d over an arbitrary projective variety.
    We show how to replace classical techniques such as the Jacobian criterion with commutative algebraic counterparts such as analytic spread  and Hilbert functions that provide facilities to study Bir(X) in full generality.
    We show that the loci of ideals in the principal class, ideals of grade at least two, and ideals of maximal analytic spread are Zariski open sets in the parameter space.
    As an application, we show that the set of birational maps of  clear polynomial degree d over an arbitrary projective variety X, denoted by Bir(X)_{d}, is a constructible set.
    This extends a previous result by Blanc and Furter.
    Salle Byron Blanc (Y106), Inria

Comments are closed.