← Search

Yuanzhe Xi

6 accepted papers

2025

Spectral-Refiner: Accurate Fine-Tuning of Spatiotemporal Fourier Neural Operator for Turbulent Flows

ICLR 2025poster

Recent advancements in operator-type neural networks have shown promising results in approximating the solutions of spatiotemporal Partial Differential Equations (PDEs). However, these neural networks often entail considerable training expenses, and may not always achieve the desired accuracy requir…

2024

A Flexible Generative Model for Heterogeneous Tabular EHR with Missing Modality

ICLR 2024poster

Realistic synthetic electronic health records (EHRs) can be leveraged to acceler- ate methodological developments for research purposes while mitigating privacy concerns associated with data sharing. However, the training of Generative Ad- versarial Networks remains challenging, often resulting in i…

Cited by 7SourcePDFScholar
2023

MuG: A Multimodal Classification Benchmark on Game Data with Tabular, Textual, and Visual Fields

EMNLP 2023long findings

Previous research has demonstrated the advantages of integrating data from multiple sources over traditional unimodal data, leading to the emergence of numerous novel multimodal applications. We propose a multimodal classification benchmark MuG with eight datasets that allows researchers to evaluate…

Cited by 0SourcecodeScholar
2022

AUTM flow: atomic unrestricted time machine for monotonic normalizing flows

UAI 2022poster

Nonlinear monotone transformations are used extensively in normalizing flows to construct invertible triangular mappings from simple distributions to complex ones. In existing literature, monotonicity is usually enforced by restricting function classes or model parameters and the inverse transformat…

Cited by 10SourcePDFScholar
2022

GDA-AM: ON THE EFFECTIVENESS OF SOLVING MIN-IMAX OPTIMIZATION VIA ANDERSON MIXING

ICLR 2022poster

Many modern machine learning algorithms such as generative adversarial networks (GANs) and adversarial training can be formulated as minimax optimization.Gradient descent ascent (GDA) is the most commonly used algorithm due to its simplicity. However, GDA can converge to non-optimal minimax points.…

Cited by 13SourcePDFScholar