Search

In recent years, the knowledge surrounding diffusion models(DMs) has grown significantly, though several theoretical gaps remain. Particularly noteworthy is prior error, defined as the discrepancy between the termination distribution of the forward process and the initial distribution of the reverse process. To address these deficiencies, this paper explores the deeper relationship between optimal transport(OT) theory and DMs with discrete initial distribution. Specifically, we demonstrate that the two stages of DMs fundamentally involve computing time-dependent OT. However, unavoidable prior error result in deviation during the reverse process under quadratic transport cost. By proving that as the diffusion termination time increases, the probability flow exponentially converges to the gradient of the solution to the classical Monge-Amp\`ere equation, we establish a vital link between these fields. Therefore, static OT emerges as the most intrinsic single-step method for bridging this theoretical potential gap. Additionally, we apply these insights to accelerate sampling in both unconditional and conditional generation scenarios. Experimental results across multiple image datasets validate the effectiveness of our approach.

Recent CLIP-guided 3D generation methods have achieved promising results but struggle with generating faithful 3D shapes that conform with input text due to the gap between text and image embeddings. To this end, this paper proposes HOTS3D which makes the first attempt to effectively bridge this gap by aligning text features to the image features with spherical optimal transport (SOT). However, in high-dimensional situations, solving the SOT remains a challenge. To obtain the SOT map for high-dimensional features obtained from CLIP encoding of two modalities, we mathematically formulate and derive the solution based on Villani's theorem, which can directly align two hyper-sphere distributions without manifold exponential maps. Furthermore, we implement it by leveraging input convex neural networks (ICNNs) for the optimal Kantorovich potential. With the optimally mapped features, a diffusion-based generator and a Nerf-based decoder are subsequently utilized to transform them into 3D shapes. Extensive qualitative and qualitative comparisons with state-of-the-arts demonstrate the superiority of the proposed HOTS3D for 3D shape generation, especially on the consistency with text semantics.

This paper introduces a novel method for reconstructing meshes from sparse point clouds by predicting edge connection. Existing implicit methods usually produce superior smooth and watertight meshes due to the isosurface extraction algorithms~(e.g., Marching Cubes). However, these methods become memory and computationally intensive with increasing resolution. Explicit methods are more efficient by directly forming the face from points. Nevertheless, the challenge of selecting appropriate faces from enormous candidates often leads to undesirable faces and holes. Moreover, the reconstruction performance of both approaches tends to degrade when the point cloud gets sparse. To this end, we propose MEsh Reconstruction via edGE~(MergeNet), which converts mesh reconstruction into local connectivity prediction problems. Specifically, MergeNet learns to extract the features of candidate edges and regress their distances to the underlying surface. Consequently, the predicted distance is utilized to filter out edges that lay on surfaces. Finally, the meshes are reconstructed by refining the triangulations formed by these edges. Extensive experiments on synthetic and real-scanned datasets demonstrate the superiority of MergeNet to SoTA explicit methods.

Unsigned distance fields (UDFs) provide a versatile framework for representing a diverse array of 3D shapes, encompassing both watertight and non-watertight geometries. Traditional UDF learning methods typically require extensive training on large datasets of 3D shapes, which is costly and often necessitates hyperparameter adjustments for new datasets. This paper presents a novel neural framework, LoSF-UDF, for reconstructing surfaces from 3D point clouds by leveraging local shape functions to learn UDFs. We observe that 3D shapes manifest simple patterns within localized areas, prompting us to create a training dataset of point cloud patches characterized by mathematical functions that represent a continuum from smooth surfaces to sharp edges and corners. Our approach learns features within a specific radius around each query point and utilizes an attention mechanism to focus on the crucial features for UDF estimation. This method enables efficient and robust surface reconstruction from point clouds without the need for shape-specific training. Additionally, our method exhibits enhanced resilience to noise and outliers in point clouds compared to existing methods. We present comprehensive experiments and comparisons across various datasets, including synthetic and real-scanned point clouds, to validate our method's efficacy., Comment: 14 pages, 11 figures

Texture mapping is a common technology in the area of computer graphics, it maps the 3D surface space onto the 2D texture space. However, the loose texture space will reduce the efficiency of data storage and GPU memory addressing in the rendering process. Many of the existing methods focus on repacking given textures, but they still suffer from high computational cost and hardly produce a wholly tight texture space. In this paper, we propose a method to optimize the texture space and produce a new texture mapping which is compact based on global parameterization. The proposed method is computationally robust and efficient. Experiments show the effectiveness of the proposed method and the potency in improving the storage and rendering efficiency., Comment: Preprint submitted to Comput. Math. Math. Phys

This paper presents a novel point cloud compression method COT-PCC by formulating the task as a constrained optimal transport (COT) problem. COT-PCC takes the bitrate of compressed features as an extra constraint of optimal transport (OT) which learns the distribution transformation between original and reconstructed points. Specifically, the formulated COT is implemented with a generative adversarial network (GAN) and a bitrate loss for training. The discriminator measures the Wasserstein distance between input and reconstructed points, and a generator calculates the optimal mapping between distributions of input and reconstructed point cloud. Moreover, we introduce a learnable sampling module for downsampling in the compression procedure. Extensive results on both sparse and dense point cloud datasets demonstrate that COT-PCC outperforms state-of-the-art methods in terms of both CD and PSNR metrics. Source codes are available at \url{https://github.com/cognaclee/PCC-COT}.

We introduce a new generative model that combines latent diffusion with persistent homology to create 3D shapes with high diversity, with a special emphasis on their topological characteristics. Our method involves representing 3D shapes as implicit fields, then employing persistent homology to extract topological features, including Betti numbers and persistence diagrams. The shape generation process consists of two steps. Initially, we employ a transformer-based autoencoding module to embed the implicit representation of each 3D shape into a set of latent vectors. Subsequently, we navigate through the learned latent space via a diffusion model. By strategically incorporating topological features into the diffusion process, our generative module is able to produce a richer variety of 3D shapes with different topological structures. Furthermore, our framework is flexible, supporting generation tasks constrained by a variety of inputs, including sparse and partial point clouds, as well as sketches. By modifying the persistence diagrams, we can alter the topology of the shapes generated from these input modalities., Comment: 16 pages, 9 figures

Sampling from diffusion probabilistic models (DPMs) can be viewed as a piecewise distribution transformation, which generally requires hundreds or thousands of steps of the inverse diffusion trajectory to get a high-quality image. Recent progress in designing fast samplers for DPMs achieves a trade-off between sampling speed and sample quality by knowledge distillation or adjusting the variance schedule or the denoising equation. However, it can't be optimal in both aspects and often suffer from mode mixture in short steps. To tackle this problem, we innovatively regard inverse diffusion as an optimal transport (OT) problem between latents at different stages and propose the DPM-OT, a unified learning framework for fast DPMs with a direct expressway represented by OT map, which can generate high-quality samples within around 10 function evaluations. By calculating the semi-discrete optimal transport map between the data latents and the white noise, we obtain an expressway from the prior distribution to the data distribution, while significantly alleviating the problem of mode mixture. In addition, we give the error bound of the proposed method, which theoretically guarantees the stability of the algorithm. Extensive experiments validate the effectiveness and advantages of DPM-OT in terms of speed and quality (FID and mode mixture), thus representing an efficient solution for generative modeling. Source codes are available at https://github.com/cognaclee/DPM-OT, Comment: iccv2023 accepted

With the widespread application of optimal transport (OT), its calculation becomes essential, and various algorithms have emerged. However, the existing methods either have low efficiency or cannot represent discontinuous maps. A novel reusable neural OT solver OT-Net is thus presented, which first learns Brenier's height representation via the neural network to obtain its potential, and then gained the OT map by computing the gradient of the potential. The algorithm has two merits, 1) it can easily represent discontinuous maps, which allows it to match any target distribution with discontinuous supports and achieve sharp boundaries. This can well eliminate mode collapse in the generated models. 2) The OT map can be calculated straightly by the proposed algorithm when new target samples are added, which greatly improves the efficiency and reusability of the map. Moreover, the theoretical error bound of the algorithm is analyzed, and we have demonstrated the empirical success of our approach in image generation, color transfer, and domain adaptation.

Intelligent Mesh Generation (IMG) represents a novel and promising field of research, utilizing machine learning techniques to generate meshes. Despite its relative infancy, IMG has significantly broadened the adaptability and practicality of mesh generation techniques, delivering numerous breakthroughs and unveiling potential future pathways. However, a noticeable void exists in the contemporary literature concerning comprehensive surveys of IMG methods. This paper endeavors to fill this gap by providing a systematic and thorough survey of the current IMG landscape. With a focus on 113 preliminary IMG methods, we undertake a meticulous analysis from various angles, encompassing core algorithm techniques and their application scope, agent learning objectives, data types, targeted challenges, as well as advantages and limitations. We have curated and categorized the literature, proposing three unique taxonomies based on key techniques, output mesh unit elements, and relevant input data types. This paper also underscores several promising future research directions and challenges in IMG. To augment reader accessibility, a dedicated IMG project page is available at \url{https://github.com/xzb030/IMG_Survey}.

We present a novel, effective method for global point cloud registration problems by geometric topology. Based on many point cloud pairwise registration methods (e.g ICP), we focus on the problem of accumulated error for the composition of transformations along any loops. The major technical contribution of this paper is a linear method for the elimination of errors, using only solving a Poisson equation. We demonstrate the consistency of our method from Hodge-Helmhotz decomposition theorem and experiments on multiple RGBD datasets of real-world scenes. The experimental results also demonstrate that our global registration method runs quickly and provides accurate reconstructions., Comment: 14 pages,6 figures

The emergent two-dimensional (2D) ferromagnetic materials with unique magnetic properties have endowed great potential for next-generation spintronic devices with extraordinary merits of high flexibility, easy controllability, and high heretointegrability, which is expected to promote the development of Moore's Law continuously. However, it is extremely challenging to realize magnetic switching with ultra-low power consumption at room temperature. Here, we demonstrate the room-temperature spin-orbit torque (SOT) driven magnetization switching in a well-epitaxial all-van der Waals (vdW) heterostructure. The topological insulator Bi2Te3 not only helps to elevate the Curie temperature of Fe3GeTe2 (FGT) through interfacial exchange coupling but also works as a spin current source allowing to switch FGT at a low current density of 2.2 * 106 A cm2. A large SOT efficiency of 0.7 is measured at room temperature, and the thickness of FGT is further adjusted to reduce the influence of the thermal contribution on the second-harmonic signal. Furthermore, the temperature and thickness-dependent SOT efficiency prove that the large SOT in our system mainly originates from the nontrivial origin of topological materials. Our experiment has enabled an all-vdW SOT structure and lays a solid foundation for the implementation of room-temperature all-vdW spintronic devices in the future.

Optimal transport (OT) plays an essential role in various areas like machine learning and deep learning. However, computing discrete optimal transport plan for large scale problems with adequate accuracy and efficiency is still highly challenging. Recently, methods based on the Sinkhorn algorithm add an entropy regularizer to the prime problem and get a trade off between efficiency and accuracy. In this paper, we propose a novel algorithm to further improve the efficiency and accuracy based on Nesterov's smoothing technique. Basically, the non-smooth c-transform of the Kantorovich potential is approximated by the smooth Log-Sum-Exp function, which finally smooths the original non-smooth Kantorovich dual functional (energy). The smooth Kantorovich functional can be optimized by the fast proximal gradient algorithm (FISTA) efficiently. Theoretically, the computational complexity of the proposed method is given by $O(n^{\frac{5}{2}} \sqrt{\log n} /\epsilon)$, which is lower than that of the Sinkhorn algorithm. Empirically, compared with the Sinkhorn algorithm, our experimental results demonstrate that the proposed method achieves faster convergence and better accuracy with the same parameter., Comment: ICML 2021 workshop for Beyond first-order methods in machine learning systems

Biomarkers play an important role in early detection and intervention in Alzheimer's disease (AD). However, obtaining effective biomarkers for AD is still a big challenge. In this work, we propose to use the worst transportation cost as a univariate biomarker to index cortical morphometry for tracking AD progression. The worst transportation (WT) aims to find the least economical way to transport one measure to the other, which contrasts to the optimal transportation (OT) that finds the most economical way between measures. To compute the WT cost, we generalize the Brenier theorem for the OT map to the WT map, and show that the WT map is the gradient of a concave function satisfying the Monge-Ampere equation. We also develop an efficient algorithm to compute the WT map based on computational geometry. We apply the algorithm to analyze cortical shape difference between dementia due to AD and normal aging individuals. The experimental results reveal the effectiveness of our proposed method which yields better statistical performance than other competiting methods including the OT., Comment: IPMI 2021, 13 pages, 3 figures

This work proposes a rigorous and practical algorithm for generating meromorphic quartic differentials for the purpose of quad-mesh generation. The work is based on the Abel-Jacobi theory of algebraic curve. The algorithm pipeline can be summarized as follows: calculate the homology group; compute the holomorphic differential group; construct the period matrix of the surface and Jacobi variety; calculate the Abel-Jacobi map for a given divisor; optimize the divisor to satisfy the Abel-Jacobi condition by an integer programming; compute the flat Riemannian metric with cone singularities at the divisor by Ricci flow; isometric immerse the surface punctured at the divisor onto the complex plane and pull back the canonical holomorphic differential to the surface to obtain the meromorphic quartic differential; construct the motor-graph to generate the resulting T-Mesh. The proposed method is rigorous and practical. The T-mesh results can be applied for constructing T-Spline directly. The efficiency and efficacy of the proposed algorithm are demonstrated by experimental results.

The auditory ossicles that are located in the middle ear are the smallest bones in the human body. Their damage will result in hearing loss. It is therefore important to be able to automatically diagnose ossicles' diseases based on Computed Tomography (CT) 3D imaging. However CT images usually include the whole head area, which is much larger than the bones of interest, thus the localization of the ossicles, followed by segmentation, both play a significant role in automatic diagnosis. The commonly employed local segmentation methods require manually selected initial points, which is a highly time consuming process. We therefore propose a completely automatic method to locate the ossicles which requires neither templates, nor manual labels. It relies solely on the connective properties of the auditory ossicles themselves, and their relationship with the surrounding tissue fluid. For the segmentation task, we define a novel energy function and obtain the shape of the ossicles from the 3D CT image by minimizing this new energy. Compared to the state-of-the-art methods which usually use the gradient operator and some normalization terms, we propose to add a Ricci curvature term to the commonly employed energy function. We compare our proposed method with the state-of-the-art methods and show that the performance of discrete Forman-Ricci curvature is superior to the others., Comment: There is a fundamental problem with the layout of our paper, and we should design a general segmentation framework rather than just focusing on the ossicles

Magnetic skyrmions are promising candidates for future storage devices with a large data density. A great variety of materials have been found that host skyrmions up to the room-temperature regime. Lorentz microscopy, usually performed in a transmission electron microscope (TEM), is one of the most important tools for characterizing skyrmion samples in real space. Using numerical calculations, this work relates the phase contrast in a TEM to the actual magnetization profile of an isolated Neel or Bloch skyrmion, the two most common skyrmion types. Within the framework of the used skyrmion model, the results are independent of skyrmion size and wall width and scale with sample thickness for purely magnetic specimens. Simple rules are provided to extract the actual skyrmion configuration of pure Bloch or Neel skyrmions without the need of simulations. Furthermore, first differential phase contrast (DPC) measurements on Neel skyrmions that meet experimental expectations are presented and showcase the described principles. The work is relevant for material sciences where it enables the engineering of skyrmion profiles via convenient characterization., Comment: 6 pages, 3 figures

Though generative adversarial networks (GANs) areprominent models to generate realistic and crisp images,they often encounter the mode collapse problems and arehard to train, which comes from approximating the intrinsicdiscontinuous distribution transform map with continuousDNNs. The recently proposed AE-OT model addresses thisproblem by explicitly computing the discontinuous distribu-tion transform map through solving a semi-discrete optimaltransport (OT) map in the latent space of the autoencoder.However the generated images are blurry. In this paper, wepropose the AE-OT-GAN model to utilize the advantages ofthe both models: generate high quality images and at thesame time overcome the mode collapse/mixture problems.Specifically, we first faithfully embed the low dimensionalimage manifold into the latent space by training an autoen-coder (AE). Then we compute the optimal transport (OT)map that pushes forward the uniform distribution to the la-tent distribution supported on the latent manifold. Finally,our GAN model is trained to generate high quality imagesfrom the latent distribution, the distribution transform mapfrom which to the empirical data distribution will be con-tinuous. The paired data between the latent code and thereal images gives us further constriction about the generator.Experiments on simple MNIST dataset and complex datasetslike Cifar-10 and CelebA show the efficacy and efficiency ofour proposed method.

This work discovers the equivalence relation between quadrilateral meshes and meromorphic quartic. Each quad-mesh induces a conformal structure of the surface, and a meromorphic differential, where the configuration of singular vertices correspond to the configurations the poles and zeros (divisor) of the meroromorphic differential. Due to Riemann surface theory, the configuration of singularities of a quad-mesh satisfies the Abel-Jacobi condition. Inversely, if a satisfies the Abel-Jacobi condition, then there exists a meromorphic quartic differential whose equals to the given one. Furthermore, if the meromorphic quadric differential is with finite, then it also induces a a quad-mesh, the poles and zeros of the meromorphic differential to the singular vertices of the quad-mesh. Besides the theoretic proofs, the computational algorithm for verification of Abel-Jacobi condition is explained in details. Furthermore, constructive algorithm of meromorphic quartic differential on zero surfaces is proposed, which is based on the global algebraic representation of meromorphic. Our experimental results demonstrate the efficiency and efficacy of the algorithm. This opens up a direction for quad-mesh generation using algebraic geometric approach.

Magnetic skyrmions are topological quasiparticles with great potential for applications in future information storage and processing devices because of their nanoscale size, high stability, and large velocity. Recently, the high-frequency properties of skyrmions have been explored for magnon nanodevices. Here we systematically study the dynamics of an isolated skyrmion under voltage excitation through the voltage-controlled magnetic anisotropy effect in a circular thin film. A theoretical model considering the demagnetization energy, which has often been neglected or treated superficially in previous skyrmion research but is demonstrated to have importance in determining the skyrmion dynamic state, is developed. With our model, the periodic oscillation of the skyrmion radius can be solved numerically with similar precision compared to micromgnetic simulations, and the characteristic frequency of the skyrmion breathing can be determined analytically with greater precision than previous studies. Furthermore, we find that the breathing skyrmion can be analogized as a modulator by investigating its linear modulation functionality under sinusoidal-form voltage excitation. Different from the conventional modulation system with complex CMOS circuits, this skyrmion modulator device integrates with both the modulation and carrier wave generation functionality, thus showing greater convenience and efficiency in applications. Our findings can provide useful guidance for both theoretical and experimental skyrmions research as well as the development of skyrmion-based magnonic devices with significant potential applicability in future communication system., Comment: 29 pages, 8 figures

This work builds the connection between the regularity theory of optimal transportation map, Monge-Amp\`{e}re equation and GANs, which gives a theoretic understanding of the major drawbacks of GANs: convergence difficulty and mode collapse. According to the regularity theory of Monge-Amp\`{e}re equation, if the support of the target measure is disconnected or just non-convex, the optimal transportation mapping is discontinuous. General DNNs can only approximate continuous mappings. This intrinsic conflict leads to the convergence difficulty and mode collapse in GANs. We test our hypothesis that the supports of real data distribution are in general non-convex, therefore the discontinuity is unavoidable using an Autoencoder combined with discrete optimal transportation map (AE-OT framework) on the CelebA data set. The testing result is positive. Furthermore, we propose to approximate the continuous Brenier potential directly based on discrete Brenier theory to tackle mode collapse. Comparing with existing method, this method is more accurate and effective.

This work proposes a novel metric based algorithm for quadrilateral mesh generating. Each quad-mesh induces a Riemannian metric satisfying special conditions: the metric is a flat metric with cone signualrites conformal to the original metric, the total curvature satisfies the Gauss-Bonnet condition, the holonomy group is a subgroup of the rotation group $\{e^{ik\pi/2}\}$, furthermore there is cross field obtained by parallel translation which is aligned with the boundaries, and its streamlines are finite geodesics. Inversely, such kind of metric induces a quad-mesh. Based on discrete Ricci flow and conformal structure deformation, one can obtain a metric satisfying all the conditions and obtain the desired quad-mesh. This method is rigorous, simple and automatic. Our experimental results demonstrate the efficiency and efficacy of the algorithm.

Variational Auto-Encoders enforce their learned intermediate latent-space data distribution to be a simple distribution, such as an isotropic Gaussian. However, this causes the posterior collapse problem and loses manifold structure which can be important for datasets such as facial images. A GAN can transform a simple distribution to a latent-space data distribution and thus preserve the manifold structure, but optimizing a GAN involves solving a Min-Max optimization problem, which is difficult and not well understood so far. Therefore, we propose a GAN-like method to transform a simple distribution to a data distribution in the latent space by solving only a minimization problem. This minimization problem comes from training a discriminator between a simple distribution and a latent-space data distribution. Then, we can explicitly formulate an Optimal Transport (OT) problem that computes the desired mapping between the two distributions. This means that we can transform a distribution without solving the difficult Min-Max optimization problem. Experimental results on an eight-Gaussian dataset show that the proposed OT can handle multi-cluster distributions. Results on the MNIST and the CelebA datasets validate the effectiveness of the proposed method.

Brain morphometry study plays a fundamental role in neuroimaging research. In this work, we propose a novel method for brain surface morphometry analysis based on surface foliation theory. Given brain cortical surfaces with automatically extracted landmark curves, we first construct finite foliations on surfaces. A set of admissible curves and a height parameter for each loop are provided by users. The admissible curves cut the surface into a set of pairs of pants. A pants decomposition graph is then constructed. Strebel differential is obtained by computing a unique harmonic map from surface to pants decomposition graph. The critical trajectories of Strebel differential decompose the surface into topological cylinders. After conformally mapping those topological cylinders to standard cylinders, parameters of standard cylinders (height, circumference) are intrinsic geometric features of the original cortical surfaces and thus can be used for morphometry analysis purpose. In this work, we propose a set of novel surface features rooted in surface foliation theory. To the best of our knowledge, this is the first work to make use of surface foliation theory for brain morphometry analysis. The features we computed are intrinsic and informative. The proposed method is rigorous, geometric, and automatic. Experimental results on classifying brain cortical surfaces between patients with Alzheimer's disease and healthy control subjects demonstrate the efficiency and efficacy of our method.

In this paper, we introduce discrete Calabi flow to the graphics research community and present a novel conformal mesh parameterization algorithm. Calabi energy has a succinct and explicit format. Its corresponding flow is conformal and convergent under certain conditions. Our method is based on the Calabi energy and Calabi flow with solid theoretical and mathematical base. We demonstrate our approach on dozens of models and compare it with other related flow based methods, such as the well-known Ricci flow and CETM. Our experiments show that the performance of our algorithm is comparably the same with other methods. The discrete Calabi flow in our method provides another perspective on conformal flow and conformal parameterization.

The problem of polycube construction or deformation is an essential problem in computer graphics. In this paper, we present a robust, simple, efficient and automatic algorithm to deform the meshes of arbitrary shapes into their polycube ones. We derive a clear relationship between a mesh and its corresponding polycube shape. Our algorithm is edge-preserved, and works on surface meshes with or without boundaries. Our algorithm outperforms previous ones in speed, robustness, efficiency. Our method is simple to implement. To demonstrate the robustness and effectiveness of our method, we apply it to hundreds of models of varying complexity and topology. We demonstrat that our method compares favorably to other state-of-the-art polycube deformation methods., Comment: 9pages,15 figures ,conference or other essential info

In this paper, we present an approach to enhance and improve the current normal map rendering technique. Our algorithm is based on semi-discrete Optimal Mass Transportation (OMT) theory and has a solid theoretical base. The key difference from previous normal map method is that we preserve the local area when we unwrap a disk-like 3D surface onto 2D plane. Compared to the currently used techniques which is based on conformal parameterization, our method does not need to cut a surface into many small pieces to avoid the large area distortion. The following charts packing step is also unnecessary in our framework. Our method is practical and makes the normal map technique more robust and efficient., Comment: we need update it

Deep learning is the mainstream technique for many machine learning tasks, including image recognition, machine translation, speech recognition, and so on. It has outperformed conventional methods in various fields and achieved great successes. Unfortunately, the understanding on how it works remains unclear. It has the central importance to lay down the theoretic foundation for deep learning. In this work, we give a geometric view to understand deep learning: we show that the fundamental principle attributing to the success is the manifold structure in data, namely natural high dimensional data concentrates close to a low-dimensional manifold, deep learning learns the manifold and the probability distribution on it. We further introduce the concepts of rectified linear complexity for deep neural network measuring its learning capability, rectified linear complexity of an embedding manifold describing the difficulty to be learned. Then we show for any deep neural network with fixed architecture, there exists a manifold that cannot be learned by the network. Finally, we propose to apply optimal mass transportation theory to control the probability distribution in the latent space.

Optical methods for magnetism manipulation have been considered as a promising strategy for ultralow-power and ultrahigh-speed spin switches, which becomes a hot spot in the field of spintronics. However, a widely applicable and efficient method to combine optical operation with magnetic modulation is still highly desired. Here, the strongly correlated electron material VO2 is introduced to realize phase-transition based optical control of the magnetism in NiFe. The NiFe/VO2 bilayer heterostructure features appreciable modulations in electrical conductivity (55%), coercivity (60%), and magnetic anisotropy (33.5%). Further analyses indicate that interfacial strain coupling plays a crucial role in this modulation. Utilizing this optically controlled magnetism modulation feature, programmable Boolean logic gates (AND, OR, NAND, NOR, XOR, NXOR and NOT) for high-speed and low-power data processing are demonstrated based on this engineered heterostructure. As a demonstration of phase-transition spintronics, this work may pave the way for next-generation electronics in the post-Moore era.

Magnetic skyrmions are promising information carriers for building future high-density and high-speed spintronic devices. However, to achieve a current-driven high-speed skyrmion motion, the required driving current density is usually very large, which could be energy inefficient and even destroy the device due to Joule heating. Here, we propose a voltage-driven skyrmion motion approach in a skyrmion shift device made of magnetic nanowires. The high-speed skyrmion motion is realized by utilizing the voltage shift, and the average skyrmion velocity reaches up to 259 m/s under 0.45 V applied voltage. In comparison with the widely studied vertical current-driven model, the energy dissipation is three orders of magnitude lower in our voltage-driven model, for the same speed motion of skyrmions. Our approach uncovers valuable opportunities for building skyrmion racetrack memories and logic devices with both ultra-low power consumption and ultra-high processing speed, which are appealing features for future spintronic applications.

In this work, we demonstrate that skyrmions can be nucleated in the free layer of a magnetic tunnel junction (MTJ) with Dzyaloshinskii-Moriya interactions (DMI) by a spin-polarized current with the assistance of stray fields from the pinned layer. The size, stability and number of created skyrmions can be tuned by either the DMI strength or the stray field distribution. The interaction between the stray field and the DMI effective field is discussed. A device with multi-level tunneling magnetoresistance is proposed, which could pave the ways for skyrmion-MTJ-based multi-bit storage and artificial neural network computation. Our results may facilitate the efficient nucleation and electrical detection of skyrmions., Comment: 4 figure in main text,14 figure in the supplementary information

In this work, we show the intrinsic relations between optimal transportation and convex geometry, especially the variational approach to solve Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. This leads to a geometric interpretation to generative models, and leads to a novel framework for generative models. By using the optimal transportation view of GAN model, we show that the discriminator computes the Kantorovich potential, the generator calculates the transportation map. For a large class of transportation costs, the Kantorovich potential can give the optimal transportation map by a close-form formula. Therefore, it is sufficient to solely optimize the discriminator. This shows the adversarial competition can be avoided, and the computational architecture can be simplified. Preliminary experimental results show the geometric method outperforms WGAN for approximating probability measures with multiple clusters in low dimensional space.

Robot Coverage Path planning (i.e., provide full coverage of a given domain by one or multiple robots) is a classical problem in the field of robotics and motion planning. The goal is to provide nearly full coverage while also minimize duplicately visited area. In this paper we focus on the scenario of path planning on general surfaces including planar domains with complex topology, complex terrain or general surface in 3D space. The main idea is to adopt a natural, intrinsic and global parametrization of the surface for robot path planning, namely the holomorphic quadratic differentials. Except for a small number of zero points (singularities), each point on the surface is given a uv-coordinates naturally represented by a complex number. We show that natural, efficient robot paths can be obtained by using such coordinate systems. The method is based on intrinsic geometry and thus can be adapted to general surface exploration in 3D., Comment: 8 pages, 13 figures, IEEE ICRA 2017

Pt/Co/heavy metal (HM) tri-layered structures with interfacial perpendicular magnetic anisotropy (PMA) are currently under intensive research for several emerging spintronic effects, such as spinorbit torque, domain wall motion, and room temperature skyrmions. HM materials are used as capping layers to generate the structural asymmetry and enhance the interfacial effects. For instance, the Pt/Co/Ta structure attracts a lot of attention as it may exhibit large Dzyaloshinskii-Moriya interaction. However, the dependence of magnetic properties on different capping materials has not been systematically investigated. In this paper, we experimentally show the interfacial PMA and damping constant for Pt/Co/HM tri-layered structures through time-resolved magneto-optical Kerr effect measurements as well as magnetometry measurements, where the capping HM materials are W, Ta, and Pd. We found that the Co/HM interface plays an important role on the magnetic properties. In particular, the magnetic multilayers with a W capping layer features the lowest effective damping value, which may be attributed to the different spin-orbit coupling and interfacial hybridization between Co and HM materials. Our findings allow a deep understanding of the Pt/Co/HM tri-layered structures. Such structures could lead to a better era of data storage and processing devices., Comment: 6 pages, 5 figures, 2 tables

It has been reported in experiments that capping layers which enhance the perpendicular magnetic anisotropy (PMA) of magnetic tunnel junctions (MTJs) induce great impact on the tunnel magnetoresistance (TMR). To explore the essential influence caused by capping layers, we carry out ab initio calculations on TMR in the X(001)|CoFe(001)|MgO(001)|CoFe(001)|X(001) MTJ, where X represents the capping layer material which can be tungsten, tantalum or hafnium. We report TMR in different MTJs and demonstrate that tungsten is an ideal candidate for a giant TMR ratio. The transmission spectrum in Brillouin zone is presented. It can be seen that in the parallel condition of MTJ, sharp transmission peaks appear in the minority-spin channel. This phenomenon is attributed to the resonant tunnel transmission effect and we explained it by the layer-resolved density of states (DOS). In order to explore transport properties in MTJs, the density of scattering states (DOSS) was studied from the point of band symmetry. It has been found that CoFe|tungsten interface blocks scattering states transmission in the anti-parallel condition. This work reports TMR and transport properties in MTJs with different capping layers, and proves that tungsten is a proper capping layer material, which would benefit the design and optimization of MTJs.

Selective Harmonic Elimination Pulse Width Modulation (SHEPWM) is an important technique to solve PWM problems, which control the output voltage of an inverter via selecting appropriate switching angles. Based on the Rational Univariate Representation (RUR) theory for solving polynomial systems, the paper presents an algorithm to compute a "nearly parametric" solution to a SHEPWM problem. When the number of switching angles N is fixed, a "nearly parametric" solution can be considered as functions of the modulation index m. So we can adapt the amplitude of the output voltage with the same source voltage by changing the modulation index. When m is given as a specific value, complete solutions to the SHEPWM problem can be obtained easily using univariate polynomial solving. Compared with other methods, m is considered as a symbolic parameter for the first time, and this can help avoid totally restarting when m changes. The average time for computing complete solutions associated to 460 modulation indexes based on a "nearly parametric" solution when N=5 is 0.0284s, so the algorithm is practical. Three groups of switching angles associated to N=5, m=0.75 is simulated in MATLAB, and it verifies the algorithm's correctness.

Magnetic skyrmion, vortex-like swirling topologically stable spin configurations, is appealing as information carrier for future nanoelectronics, owing to the stability, small size and extremely low driving current density. One of the most promising applications of skyrmion is to build racetrack memory (RM). Compared to domain wall-based RM (DW-RM), skyrmion-based RM (Sky-RM) possesses quite a few benefits in terms of energy, density and speed etc. Until now, the fundamental behaviors, including nucleation/annihilation, motion and detection of skyrmion have been intensively investigated. However, one indispensable function, i.e., pinning/depinning of skyrmion still remains an open question and has to be addressed before applying skyrmion for RM. Furthermore, Current research mainly focuses on physical investigations, whereas the electrical design and evaluation are still lacking. In this work, we aim to promote the development of Sky-RM from fundamental physics to realistic electronics. First, we investigate the pinning/depinning characteristics of skyrmion in a nanotrack with the voltage-controlled magnetic anisotropy (VCMA) effect. Then, we propose a compact model and design framework of Sky-RM for electrical evaluation. This work completes the elementary memory functionality of Sky-RM and fills the technical gap between the physicists and electronic engineers, making a significant step forward for the development of Sky-RM., Comment: 10 pages, 8 figures

Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method discloses the essential geometric connection between the relative position of the points with multiplicity structures and the quotient basis of the vanishing ideal, so we will explicitly know the set of leading terms of elements of I. We split the problem into several smaller ones which can be solved by induction over variables and then use our new algorithm for intersection of ideals to compute the result of the original problem. The new algorithm for intersection of ideals is mainly based on the Extended Euclidean Algorithm., Comment: 12 pages,12 figures,ASCM 2012

We report direct observation of charge accumulation effect on magnetization reversal in a Pt/Co(0.5 nm)/Pt(0.5 nm)/Al2O3 structure with perpendicular anisotropy. By imaging magnetic domain with polar Kerr microscopy, we evidence that positive charges accumulating at the Pt/Al2O3 interface result in favoring magnetic domain wall propagation, while negative charges hinder domain wall nucleation and propagation. Our results suggest that magnetic properties in Co layer can be strongly influenced by 5d electron accumulation/depletion in an ultrathin Pt layer., Comment: 4 pages, 4 figures, added references

Power dissipation is one of the most important factors limiting the future miniaturisation of integrated circuits. The capability of controlling magnetic states with a low voltage through magnetoelectric coupling in magnetostrictive/piezoelectric systems may pave the way toward ultra low-power electronics. Although the former effect has been demon-strated in several multiferroic heterostructures, the incorporation of such complex geometries into practical magnetic memory and logic nanodevices has been lacking. Here, we demonstrate the room temperature control of a domain wall gate with an electric field in a nanowire consisting of a laterally polarized piezoelectric bar inducing a giant strain in a ferromagnetic spin-valve. We propose to use such novel domain wall gate as an elementary brick to generate a complete set of boolean logic functions or stabilize domain walls in high density memory applications., Comment: 16 pages, 4 figures

In this paper, we first apply the Fitzpatrick algorithm to osculatory rational interpolation. Then based on Fitzpatrick algorithm, we present a Neville-like algorithm for Cauchy interpolation. With this algorithm, we can determine the value of the interpolating function at a single point without computing the rational interpolating function.