Modeling 3D continua with singular points using Yin sets.
problem Treat singular points as central subjects in 3D continuum topology.
method Model 3D continua as Yin sets, regular open semianalytic sets with bounded boundary.
result Characterize local and global topology of Yin sets.
Ancient solutions to curve shortening flow are constructed and analyzed.
problem Constructing ancient solutions to curve shortening flow.
method Analyzing the rotating Yin-Yang soliton and Grim Reaper translating soliton to approximate the solution.
result An ancient solution to planar curve shortening is constructed and analyzed.
This paper classifies all expanding Ricci solitons on surfaces.
problem Identifying all expanding Ricci solitons on surfaces.
method Developed a Ricci flow existence theory and used uniqueness theory to classify solitons.
result Classified all expanding Ricci solitons on surfaces.
New gradient estimators for discrete variables improve model training.
problem Training models with discrete latent variables is challenging due to high gradient variance.
method Introduced novel gradient estimators based on importance sampling and statistical couplings, extending to categorical variables.
result Proposed gradient estimators outperform previous methods in systematic experiments.
Compact, non-convex curve flows are created.
problem Creating compact, non-convex ancient solutions for curve shortening flow.
method Constructed an ancient solution asymptotic to Yin-Yang curve.
result Compact, non-convex ancient solutions for curve shortening flow are demonstrated.
We construct a formal normal form for a real 2-codimensional submanifold M⊂CN+1 near a CR singularity approximating the sphere. This result gives a higher dimensional extension of Huang-Yin's normal form in C2.
Willmore-type inequalities for bounded domains in manifolds with curvature bounds.
problem Establishing inequalities for bounded domains in manifolds with curvature bounds.
method Using asymptotic or integral Ricci curvature bounds to establish inequalities.
result Recovering a recent inequality of Jin-Yin.
The three operator splitting scheme was recently proposed by [Davis and Yin, 2015] as a method to optimize composite objective functions with one convex smooth term and two convex (possibly non-smooth) terms for which we have access to their proximity operator. In this short note we provide an alternative proof for the…
In this paper, we discuss uniqueness and backward uniqueness for mean curvature flow of non-compact manifolds. We use an energy argument to prove two uniqueness theorems for mean curvature flow with possibly unbounded curvatures. These generalize the results by Chen and Yin. Using similar method, we also obtain a uniqu…
This paper continues the previous studies in two papers of Huang-Yin [HY3-4] on the flattening problem of a CR singular point of real codimension two sitting in a submanifold in Cn+1 with n+1≥3, whose CR points are non-minimal. Partially based on the geometric approach initiated in [HY3] and a forma…
GenAI offers financial benefits but requires risk management.
problem Managing risks in financial applications of AI.
method Balancing AI's potential with risk control strategies.
result Proper risk management is essential for AI growth in finance.
We describe mirror symmetry on higher dimensional tori, paying special attention to the behaviour of D-branes under mirror symmetry. To find the mirror D-branes the description of mirror symmetry on D-branes due to Ooguri, Oz en Yin is used. This method allows us to deal with the coisotropic D-branes recently introduce…
Co-Clustering, the problem of simultaneously identifying clusters across multiple aspects of a data set, is a natural generalization of clustering to higher-order structured data. Recent convex formulations of bi-clustering and tensor co-clustering, which shrink estimated centroids together using a convex fusion penalt…
Study Yang-Mills connections on four-manifolds, derive obstructions to bubbling.
problem Bubbling configurations in Yang-Mills fields on four-manifolds.
method Derived Pohozaev type compatibility between weak limit connection and bubbles, involving Weyl tensor.
result Obstructions to certain bubbling configurations on CP2.
New algorithm for fast nonsmooth optimization with applications in image processing and machine learning.
problem Minimizing the sum of three convex functions with specific properties.
method PDDY algorithm, based on Davis-Yin splitting in a primal-dual product space.
result Sublinear and linear convergence rates in various scenarios, including strong convexity.
Extends Manin triples to Lie bialgebroids over Lie groupoids.
problem Characterizing Lie bialgebroids via Manin triples.
method Establishing correspondence between Lie bialgebroid groupoids and multiplicative Manin triples.
result New viewpoint on co-quadratic Lie algebroids and Manin triple description of Lie bialgebroid crossed modules.
We prove that the Yang-Mills α-functional satisfies the Palais-Smale condition. This guarantees the existence of critical points, which are called Yang-Mills α-connections. It was shown by Hong, Tian and Yin in [10] (to appear in Comm. Math. Helv.) that as α→1, a sequence of Yang-Mills α-connections converge…
The study proves that certain noncompact Hessian manifolds are diffeomorphic to R^n.
problem Characterizing complete noncompact Hessian manifolds with nonnegative Hessian sectional curvature.
method Using a geometric flow on noncompact affine Riemannian manifolds, constructing Hessian metrics, and proving diffeomorphism.
result Complete noncompact Hessian manifolds with nonnegative Hessian sectional curvature are diffeomorphic to R^n if their tangent bundle has maximal volume growth.
Efficient algorithms recover two sparse models from a mix of linear queries.
problem Recovering two sparse models from a mix of linear queries.
method Efficient algorithms for query complexity problem.
result Improved query complexity for model recovery.
Sufficient dimension reduction (SDR) using distance covariance (DCOV) was recently proposed as an approach to dimension-reduction problems. Compared with other SDR methods, it is model-free without estimating link function and does not require any particular distributions on predictors (see Sheng and Yin, 2013, 2016). …
Derive monotone quantities for harmonic functions on asymptotically flat 3-manifolds with nonnegative scalar curvature.
problem Derive monotone quantities for harmonic functions on asymptotically flat 3-manifolds with nonnegative scalar curvature.
method Follow the strategy developed in Miao.
result Derive monotone quantities for harmonic functions on asymptotically flat 3-manifolds with nonnegative scalar curvature.
Unified convergence analysis of alpha-SVRG under strong convexity.
problem Analyzing the convergence of alpha-SVRG in strongly convex environments.
method Unified convergence rate expression for alpha-SVRG under fixed learning rate, demonstrating faster convergence than SGD and SVRG.
result alpha-SVRG has a faster convergence rate compared to SGD and SVRG under suitable choice of alpha.
CoDA adapts dynamics models to new physical systems by conditioning on context.
problem Generalizing to new physical systems with shared dynamics but different contexts.
method Context-informed dynamics adaptation (CoDA) using multiple environments and a hypernetwork.
result State-of-the-art generalization results on nonlinear dynamics.
Extends rigidity results for Whitney spheres in higher dimensions.
problem Rigidity of Lagrangian submanifolds in complex and projective spaces.
method Analyzes Lagrangian submanifolds satisfying specific differential conditions.
result Characterizes Whitney spheres in Cn and CPn. Paper tackles Byzantine attacks in Federated Learning by clustering and robustifying.
problem Adversarial attacks from Byzantine machines in Federated Learning.
method Iterative Federated Clustering Algorithm (IFCA) with trimmed mean and median aggregation.
result Improved convergence rate for strongly convex loss functions in Byzantine-Robust IFCA.
We develop a communication-efficient distributed learning algorithm that is robust against Byzantine worker machines. We propose and analyze a distributed gradient-descent algorithm that performs a simple thresholding based on gradient norms to mitigate Byzantine failures. We show the (statistical) error-rate of our al…
LEADS improves model generalization across different environments.
problem Modeling dynamical systems from varied environments leads to biased or scarce solutions.
method LEADS learns a shared model capturing common dynamics and additional terms for environment-specific dynamics.
result LEADS improves model generalization for both known and novel environments.
In the problem of learning mixtures of linear regressions, the goal is to learn a collection of signal vectors from a sequence of (possibly noisy) linear measurements, where each measurement is evaluated on an unknown signal drawn uniformly from this collection. This setting is quite expressive and has been studied bot…
This paper improves bounds on DNN generalization to adversarial examples.
problem Improving generalization of deep neural networks to adversarial data.
method Investigates Rademacher complexity and introduces a new covering number.
result Achieves upper bounds for adversarial Rademacher complexity matching standard settings.
Framework augments physical models with deep learning for complex dynamics forecasting.
problem Forecasting complex dynamical phenomena with partial knowledge.
method APHYNITY framework: decomposes dynamics into physical and data-driven components.
result Framework accurately forecasts system evolution and identifies relevant parameters.
The paper analyzes adversarial robustness for linear models and neural networks using Rademacher complexity.
problem Understanding adversarial robustness of linear models and neural networks.
method The paper uses Rademacher complexity to provide upper and lower bounds for adversarial robustness of linear hypotheses and neural networks.
result The paper provides bounds on adversarial Rademacher complexity for linear hypotheses and neural networks, offering a finer analysis of input dimensionality.
A new gradient estimator reduces variance near boundaries for binary latent variables.
problem Explosive gradient variance near boundaries in binary latent variable models.
method Introduces a new gradient estimator (bitflip-1) and an aggregated estimator (UGC) that uses either bitflip-1 or DisARM for each coordinate.
result UGC has uniformly lower variance than DisARM and achieves optimal optimization objectives.
Optimization is at the heart of machine learning, statistics and many applied scientific disciplines. It also has a long history in physics, ranging from the minimal action principle to finding ground states of disordered systems such as spin glasses. Proximal algorithms form a class of methods that are broadly applica…
Many important applications, including signal reconstruction, parameter estimation, and signal processing in a compressed domain, rely on a low-dimensional representation of the dataset that preserves {\em all} pairwise distances between the data points and leverages the inherent geometric structure that is typically p…
Improved concentration inequalities for sub-Weibull variables enhance statistical and machine learning applications.
problem Improving concentration inequalities for sub-Weibull random variables.
method Developed new concentration inequalities for sums of independent sub-Weibull random variables, including a new sub-Weibull parameter.
result New concentration inequalities with sharper constants and a mixture of sub-Gaussian and sub-Weibull tails.
The paper resolves a problem about metric inequivalence and characterizes proper holomorphic maps.
problem Metric inequivalence and characterization of proper holomorphic maps.
method Explicit characterization of proper holomorphic maps from a finitely-connected planar domain onto the unit disk.
result Characterization of proper holomorphic maps from a finitely-connected planar domain onto the unit disk.
Study shows Julia sets and gasket limit sets are quasiconformally different.
problem Quasiconformal non-equivalence of Julia sets and gasket limit sets.
method Proved quasiconformal non-equivalence of Julia sets and gasket limit sets.
result Julia sets and gasket limit sets are quasiconformally different.
Study shows non-symmetric convex sets have full boundary limits.
problem Understanding boundaries of non-symmetric convex sets.
method Proved using proximal limit set analysis.
result Proximal limit set equals full projective boundary for non-symmetric irreducible divisible convex sets.
The paper analyzes set-to-set matching with neural networks, focusing on theoretical generalization.
problem Theoretical analysis of set-to-set matching with neural networks.
method Generalization error analysis of set-to-set matching with neural networks.
result Theoretical insights into the behavior of set-to-set matching models.
Generative model learns to autoencode and generate sets of images.
problem Learning to represent and generate sets of images with unknown number of sets.
method Set Distribution Networks (SDNs) learn set encoder, discriminator, generator, and prior.
result SDNs can reconstruct and generate sets of images with preserved attributes.
Study on cold and freezing sets in digital images.
problem Properties of cold sets in digital images.
method Analysis of properties and relationships between cold and freezing sets.
result Examined relationships between cold and freezing sets.
Paper solves whether zero sets are mapping degree sets.
problem Whether finite sets containing zero are mapping degree sets.
method Examined oriented closed connected manifolds of the same dimension.
result Affirmative answer given for both integer and rational settings.
Matching two different sets of items, called heterogeneous set-to-set matching problem, has recently received attention as a promising problem. The difficulties are to extract features to match a correct pair of different sets and also preserve two types of exchangeability required for set-to-set matching: the pair of …
New set-valued star-shaped risk measures introduced for better risk assessment.
problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.
We introduce the concept of hereditarily non uniformly perfect sets, compact sets for which no compact subset is uniformly perfect, and compare them with the following: Hausdorff dimension zero sets, logarithmic capacity zero sets, Lebesgue 2-dimensional measure zero sets, and porous sets. In particular, we give an exa…
Study dynamics and topology of flows near non-saddle sets or W-sets.
problem Understanding the dynamics and topology of flows near specific invariant sets.
method Cohomological relations and global properties analysis.
result Dynamical classification of surfaces and robustness of non-saddle-sets.
The study explores mapping degree sets and their properties for manifolds.
problem Understanding the structure and properties of mapping degree sets for manifolds.
method Analyzes the properties of mapping degree sets and their relationships with self-mapping degree sets.
result Not every multiplicative set containing 0,1 is a self-mapping degree set.
Current approaches for predicting sets from feature vectors ignore the unordered nature of sets and suffer from discontinuity issues as a result. We propose a general model for predicting sets that properly respects the structure of sets and avoids this problem. With a single feature vector as input, we show that our m…