Robust image translation model for noisy labels.
problem Learning mappings among multiple domains with noisy labeled data.
method Proposes a novel loss function and techniques to handle noisy labeled data.
result Demonstrates robustness in various settings including synthetic and real-world noise.
New parities defined on virtual knots linked to crossing indices.
problem Defining parities on virtual knots.
method Connecting parities to invariant cycles on arcs and quasi-indices on crossings.
result New series of parities on virtual knots defined.
The constructions of the virtual Euler (or moduli) cycles and their properties are explained and developed systematically in the general abstract settings.
Constructs an explicit cycle in arithmetic group cohomology.
problem Cohomology of SLn(Z) at virtual cohomological dimension. method Geometric rigidity of Voronoi tessellations and abstract framework for polyhedral tessellations.
result Explicit canonical cycle in top-dimensional homology of Voronoi complex.
Neural network HDP improves virtual inertia control for non-inductive grids.
problem Traditional virtual inertia controllers are not suitable for non-inductive grids.
method Adaptive neural network heuristic dynamic programming (HDP) for optimal control.
result The proposed HDP controller outperforms traditional controllers in virtual inertia control.
Generating an image from its description is a challenging task worth solving because of its numerous practical applications ranging from image editing to virtual reality. All existing methods use one single caption to generate a plausible image. A single caption by itself, can be limited, and may not be able to capture…
Explicitly found generators of cohomology for SL_n(Z) using sharbly cycles and cosharbly cocycles.
problem Finding explicit generators for the cohomology of SL_n(Z).
method Using sharbly cycles and cosharbly cocycles, and applying Borel-Serre duality.
result Explicitly found generators of H_t(SL_n(Z),St) in terms of sharbly cycles and cosharbly cocycles.
We propose a parallel-data-free voice-conversion (VC) method that can learn a mapping from source to target speech without relying on parallel data. The proposed method is general purpose, high quality, and parallel-data free and works without any extra data, modules, or alignment procedure. It also avoids over-smoothi…
Proposes a new method to improve target annotation in ATR.
problem Challenges in annotating automatic target recognition due to lack of labeled data.
method Hybrid contrastive learning and cycle-consistency-based transductive transfer learning (C3TTL) framework.
result Significantly lower Fréchet Inception Distance (FID) score and improved performance in annotating civilian and military vehicles, as well as ship targets.
Virtual knots are associated with knot diagrams, which are not obligatory planar. The recently suggested generalization from N=2 to arbitrary N of the Kauffman-Khovanov calculus of cycles in resolved diagrams can be straightforwardly applied to non-planar case. In simple examples we demonstrate that this construction p…
This paper constructs and studies the Gromov-Witten invariants and their properties for noncompact geometrically bounded symplectic manifolds. Two localization formulas for GW-invariants are also proposed and proved. As applications we get solutions of the generalized string equation and dilation equation and their var…
We present a framework for translating unlabeled images from one domain into analog images in another domain. We employ a progressively growing skip-connected encoder-generator structure and train it with a GAN loss for realistic output, a cycle consistency loss for maintaining same-domain translation identity, and a s…
RCGAN improves anomaly detection by better recognizing anomalous samples.
problem Previous methods fail to correctly detect anomalous data.
method RCGAN uses adversarial training with a new loss function and penalty distribution.
result RCGAN outperforms state-of-the-art methods on various datasets.
New polynomial invariants defined for long virtual knots.
problem Defining and studying polynomial invariants for long virtual knots.
method Intersection numbers of cycles on a closed surface, considering crossing order.
result Intersection polynomials are finite-type invariants of degree two under crossing changes, but not under virtualizations.
Proposes new terms for neural image compression to improve quality and efficiency.
problem Improving the quality and efficiency of neural image compression.
method Introduces a compression objective and a cycle loss term, applied to autoencoder encoder outputs, combined with reconstruction losses.
result Different autoencoders trained with varying losses produce images with distinct perceptual qualities and image-domain distortions.
Paper proves a relative version of coarse Alexander duality and applies it to Jordan cycles.
problem Proving a relative version of coarse Alexander duality.
method Introduced a relative Čech homology satisfying Eilenberg-Steenrod Exactness Axiom.
result Jordan cycle invariant in proving existence of certain 3-manifold groups.
Improved TTS style transfer across disjoint datasets with adversarial cycle consistency.
problem Suboptimal TTS style transfer on disjoint datasets with underrepresented styles.
method Adversarial cycle consistency training with paired and unpaired triplets.
result 78% improvement in style transfer with minimal reduction in fidelity and naturalness.
Presently the most successful approaches to semi-supervised learning are based on consistency regularization, whereby a model is trained to be robust to small perturbations of its inputs and parameters. To understand consistency regularization, we conceptually explore how loss geometry interacts with training procedure…
Novel unsupervised method for fast 3D image registration using cycle-consistent CNN.
problem Medical image registration for cancer diagnosis.
method Unsupervised deep learning using cycle-consistent CNN for deformable registration.
result Very precise 3D image registration within a few seconds, improving cancer size estimation.
CycleMorph improves image registration by preserving topology with cycle consistency.
problem Preserving original topology during deformation in image registration.
method Cycle-consistent deformable image registration approach.
result Effective and accurate registration on diverse image pairs within seconds.
We use Liu-Tian's virtual moduli cycle methods to construct detailedly the explicit isomorphism between Floer homology and quantum homology for any closed symplectic manifold that was first outlined by Piunikhin, Salamon and Schwarz for the case of the semi-positive symplectic manifolds.
New theorem bounds link volume using surface coefficients.
problem Bounding hyperbolic volume of links on surfaces.
method Analogue of Dasbach-Lin theorem for surface links.
result Bounds on link volume from surface polynomial coefficients.
New CycleGAN uses invertible generator for faster, less resource-intensive CT denoising.
problem Efficient unsupervised CT denoising without paired data.
method Single generator with wavelet residual domain, no discriminators, cycle consistency via invertible generator.
result Significantly improved denoising performance with faster training and less parameters.
We propose a new regularization method based on virtual adversarial loss: a new measure of local smoothness of the conditional label distribution given input. Virtual adversarial loss is defined as the robustness of the conditional label distribution around each input data point against local perturbation. Unlike adver…
New method solves group synchronization with cycle-edge message passing.
problem Solving group synchronization with adversarial or uniform corruption and small noise.
method Cycle-edge message passing procedure using cycle consistency information.
result Exact recovery and linear convergence guarantees under adversarial corruption.
This work proposes a new method to match distributions across different spaces using cycle-consistent maps.
problem Matching distributions across different spaces with consistent bidirectional maps.
method A novel unbalanced Monge optimal transport formulation for matching distributions on different spaces, employing cycle-consistent maps.
result The proposed discrepancy captures the cycle-consistent GAN framework and provides theoretical support.
This paper uses LLMs and cycle consistency for better machine translation evaluation.
problem Evaluating translation quality and LLM capabilities without ground truth.
method Generate translation candidates, back-translate, and evaluate cycle consistency.
result Larger LLMs or more inference passes improve cycle consistency.
Unsupervised method removes satellite noise without paired data.
problem Image artifacts from satellite sensor noises affect quality and applications.
method Wavelet subband cycleGAN using adversarial and cycle-consistency losses.
result Effectively removes satellite noise while preserving high frequency features.
New method uses cycle consistency to enforce invariance in latent space.
problem Learning meaningful and independent factors of variation in datasets.
method Two separate latent subspaces, cycle consistency constraints, deep information bottleneck.
result Identifies more meaningful factors leading to sparser and interpretable models.
Develops a semi-supervised learning method to generate missing neuroimaging modalities.
problem Lack of paired neuroimaging data for training and inference.
method Semi-Supervised Adversarial CycleGAN (SSA-CGAN) using adversarial and cycle losses.
result Improves reconstruction error and robustness to noise.
Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to intr…
In coronary CT angiography, a series of CT images are taken at different levels of radiation dose during the examination. Although this reduces the total radiation dose, the image quality during the low-dose phases is significantly degraded. To address this problem, here we propose a novel semi-supervised learning tech…
Spectral images captured by satellites and radio-telescopes are analyzed to obtain information about geological compositions distributions, distant asters as well as undersea terrain. Spectral images usually contain tens to hundreds of continuous narrow spectral bands and are widely used in various fields. But the vast…
New unsupervised image translation method detects changes without labeled data.
problem Detecting changes in images without labeled data.
method Affinity-based change priors and weighted loss functions trained on convolutional neural networks.
result Proposed method outperforms state-of-the-art algorithms in detecting changes.
Let (X,ωX∗) be a separated, −2-shifted symplectic derived C-scheme, in the sense of Pantev, Toen, Vezzosi and Vaquie arXiv:1111.3209, of complex virtual dimension vdimCX=n∈Z, and Xan the underlying complex analytic topological space. We prove that …
This article is the second part of the article we promised to write at the end of Section 1 of [FOOO15] (arXiv:1209.4410). (Part I appeared in [Part I] (arXiv:1503.07631).) We discuss the foundation of the virtual fundamental chain and cycle technique, especially its version that appeared in [FOn] and also in Section A…
End-to-end algorithm for W-2 distance using neural networks.
problem Training optimal transport mappings for W-2 distance.
method Input convex neural networks and cycle-consistency regularization.
result Algorithm scales well to high dimensions without bias.
We extend to the long virtual knot case the constructions first presented by A. Henrich and later generalized by the author to the framed virtual knot case. These consist of three Vassiliev invariants of order one, including a universal one, as well as the notions of a based matrix and a singular based matrix and their…
CMCO provides robust uncertainty estimates for neural operators without retraining.
problem Uncertainty quantification in deep learning for real-time virtual sensing.
method Unified Monte Carlo dropout and split conformal prediction in DeepONet.
result Near-nominal empirical coverage in diverse applications.
Physics-Informed Neural Networks improve N2O flux predictions over classical models.
problem Predicting N2O flux emissions from agricultural processes.
method Constructed a rigorously derived physics residual from DayCent models and trained an MLP-based PINN on agricultural data.
result Physics-Informed Neural Networks consistently outperform classical models in predicting N2O flux emissions.
We define counting and cocycle enhancement invariants of virtual knots using parity biquandles. These invariants are determined by pairs consisting of a biquandle 2-cocycle φ^0 and a map φ^1 with certain compatibility conditions leading to one-variable or two-variable polynomial invariants of virtual knots. We provide …
The study shows that certain Artin groups cannot contain hyperbolic manifold groups.
problem Proving that certain Artin groups cannot contain hyperbolic manifold groups.
method Elementary proof, using the Virtual Fibering Conjecture and Belegradek's splitting theorem.
result Right-angled Artin groups cannot contain finite volume hyperbolic 3-manifold groups.
Credit expansion led to stronger household leverage cycles during the U.S. business cycle.
problem Understanding the role of credit supply in the U.S. business cycle.
method Causal evidence from 1999-2010 U.S. business cycle data.
result Credit expansion, particularly in private-label mortgages, caused stronger household leverage cycles.
In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the property that the set of pairwise matchings is cycle-consistent, i.e. in the full…
Paper proposes Cycle-of-Learning framework for better reinforcement learning performance.
problem Efficiently updating policies trained with demonstrations using reinforcement learning.
method Cycle-of-Learning framework combining behavior cloning and 1-step Q-learning losses.
result Cycle-of-Learning framework improves reinforcement learning performance in dense and sparse reward scenarios.
A new method improves robustness in image translation by modeling uncertainty.
problem Performance degradation in image translation models due to lack of robustness to outliers and uncertainty.
method UGAC method based on Uncertainty-aware Generalized Adaptive Cycle Consistency, modeling per-pixel residual with generalized Gaussian distribution.
result Our method exhibits stronger robustness towards unseen perturbations in test data.
This study optimizes cycle representatives in persistent homology using linear programming.
problem Non-uniqueness of cycle representatives in persistent homology creates ambiguity.
method Optimization of cycle representatives using linear programming methods.
result Optimization reduces the size of cycle representatives and is effective in most data sets.
New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.
problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.