SearcharxivSearch

arXiv subjects

Chongyao Chen

Publications and source records attributed to Chongyao Chen.

7 recordsLinked to original sources

SupReMix: Supervised Contrastive Learning for Medical Imaging Regression with Mixup

In medical image analysis, regression plays a critical role in computer-aided diagnosis. It enables quantitative measurements such as age prediction from structural imaging, cardiac function quantification, and molecular measurement from PET scans. While deep learning has shown promise for these tasks, most approaches focus solely on optimizing regression loss or model architecture, neglecting the quality of learned feature representations which are crucial for robust clinical predictions. Directly applying representation learning techniques designed for classification to regression often results in fragmented representations in the latent space, yielding sub-optimal performance. In this paper, we argue that the potential of contrastive learning for medical image regression has been overshadowed due to the neglect of two crucial aspects: ordinality-awareness and hardness. To address these challenges, we propose Supervised Contrastive Learning for Medical Imaging Regression with Mixup (SupReMix). It takes anchor-inclusive mixtures (mixup of the anchor and a distinct negative sample) as hard negative pairs and anchor-exclusive mixtures (mixup of two distinct negative samples) as hard positive pairs at the embedding level. This strategy formulates harder contrastive pairs by integrating richer ordinal information. Through theoretical analysis and extensive experiments on six datasets spanning MRI, X-ray, ultrasound, and PET modalities, we demonstrate that SupReMix fosters continuous ordered representations, significantly improving regression performance.

cs.LG

Improve Representation for Imbalanced Regression through Geometric Constraints

In representation learning, uniformity refers to the uniform feature distribution in the latent space (i.e., unit hypersphere). Previous work has shown that improving uniformity contributes to the learning of under-represented classes. However, most of the previous work focused on classification; the representation space of imbalanced regression remains unexplored. Classification-based methods are not suitable for regression tasks because they cluster features into distinct groups without considering the continuous and ordered nature essential for regression. In a geometric aspect, we uniquely focus on ensuring uniformity in the latent space for imbalanced regression through two key losses: enveloping and homogeneity. The enveloping loss encourages the induced trace to uniformly occupy the surface of a hypersphere, while the homogeneity loss ensures smoothness, with representations evenly spaced at consistent intervals. Our method integrates these geometric principles into the data representations via a Surrogate-driven Representation Learning (SRL) framework. Experiments with real-world regression and operator learning tasks highlight the importance of uniformity in imbalanced regression and validate the efficacy of our geometry-based loss functions.

cs.LG

Representation Theorem for Multivariable Totally Symmetric Functions

In this work, we establish a representation theorem for multivariable totally symmetric functions: a multisymmetric continuous function must be the composition of a continuous function and a set of generators of the multisymmetric polynomials. We then study the singularity and geometry of the generators, and show that the regularity may become worse after applying the decomposition.

math.CA

Quadratically enriched binomial coefficients over a finite field

We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of degree $n$. We also compute a quadratic twist. These (twisted) enriched binomial coefficients are defined in joint work of Brugall\'e and the second-named author, building on work of Serre. Such binomial coefficients support curve counting results over non-algebraically closed fields, using $\mathbb{A}^1$-homotopy theory.

math.NT

On the generic degree of two-parameter period mappings

We present a method for computing the generic degree of a period map defined on a quasi-projective surface. As an application, we explicitly compute the generic degree of three period maps underlying families of Calabi-Yau 3-folds coming from toric hypersurfaces. As a consequence, we show that the generic Torelli theorem holds for these cases.

math.AG

Completion of a period map of Hodge type (1,2,2,1)

We give a completion of the period map associated to a variation of polarized Hodge structure arising from a 2-dimensional geometric family that has Hodge type (1,2,2,1). This is the second known example of a completion of a period map that is higher than one dimensional with non-hermitian symmetric Mumford-Tate domain. The completion technique we use is the theory of Kato-Usui spaces, while the calculation of monodromy matrices is done with the help of mirror symmetry.

math.AG