Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

70140209279 · May 202619922001200920172026
48 results for cycle consistency

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.

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.

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.

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…

2012-10-16abs ↗pdf ↗

Medical image registration is one of the key processing steps for biomedical image analysis such as cancer diagnosis. Recently, deep learning based supervised and unsupervised image registration methods have been extensively studied due to its excellent performance in spite of ultra-fast computational time compared to …

2019-07-02abs ↗pdf ↗

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.

We propose a general framework for solving the group synchronization problem, where we focus on the setting of adversarial or uniform corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of gr…

2019-12-24abs ↗pdf ↗

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.

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.

The proposed model is aimed to reveal important patterns in the behavior of a simplified financial system. The patterns could be detected as regular cycles consisting of debt bubbles and crises. Financial cycles have a well defined structure and form periodic sequences along the axis of credit expansion while retaining…

2016-07-05abs ↗pdf ↗

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.

We propose a novel end-to-end non-minimax algorithm for training optimal transport mappings for the quadratic cost (Wasserstein-2 distance). The algorithm uses input convex neural networks and a cycle-consistency regularization to approximate Wasserstein-2 distance. In contrast to popular entropic and quadratic regular…

2019-09-28abs ↗pdf ↗

The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-match…

2018-11-26abs ↗pdf ↗

FedCluster accelerates federated learning convergence by cycling device groups.

problem Federated learning convergence issues with device-level data heterogeneity.
method FedCluster groups devices into clusters that cycle through learning rounds, boosting convergence with meta-updates.
result FedCluster achieves faster convergence in nonconvex optimization compared to FedAvg.

Agent-based market shows herding cycles with square-root price impact.

problem Understanding herding cycles in agent-based markets.
method Agent-based model with 20,000 retail traders interacting with a single institutional agent.
result Agent discovers multi-cycle predatory strategy with 8-11 complete cycles over 2000 trading days.

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…

2018-09-20abs ↗pdf ↗

Scalable algorithm for computing Wasserstein-2 barycenters without bias.

problem Computing Wasserstein-2 barycenters efficiently and accurately.
method Input convex neural networks and cycle-consistency regularization.
result Our approach avoids introducing bias and does not require minimax optimization.

We formalize the problem of learning interdomain correspondences in the absence of paired data as Bayesian inference in a latent variable model (LVM), where one seeks the underlying hidden representations of entities from one domain as entities from the other domain. First, we introduce implicit latent variable models,…

2018-06-05abs ↗pdf ↗

Study on second homology group of genus 3 hyperelliptic Torelli group.

problem Understanding the structure of second homology group of genus 3 hyperelliptic Torelli group.
method Analyzing abelian cycles associated with disjoint separating curves and their algebraic properties.
result Simple abelian cycles are linearly independent in the second homology group.

Modeling business cycles via collective risk fluctuations in economic agents' risk space.

problem Understanding and predicting business cycles through economic agents' risk dynamics.
method Continuous numerical risk grades for economic agents, modeling collective economic variables and flows as functions of risk coordinates, deriving equations for their evolution.
result Business and credit cycles are explained as fluctuations of collective economic variables and their mean risks in the risk space of economic agents.

CDLF predicts product life-cycles in cold-start phases with high accuracy.

problem Forecasting new products in early phases when data is scarce.
method Conditional Diffusion Life-cycle Forecaster (CDLF) combining static descriptors, reference trajectories, and new observations.
result CDLF outperforms classical models in accuracy and probabilistic forecasting.

This paper suggests that business cycles may be a manifestation of coupled real economy and stock market dynamics and describes a mechanism that can generate economic fluctuations consistent with observed business cycles. To this end, we seek to incorporate into the macroeconomic framework a dynamic stock market model …

2018-03-06abs ↗pdf ↗

The study constructs a Legendrian cycle for FnW2,nF_nW^{2,n}-sets and proves Reilly-type variational formulae.

problem Understanding higher-order mean curvature integrals of non-smooth sets.
method Construction of a Legendrian cycle and analysis of proximal unit normal bundles.
result Reilly-type variational formulae for higher-order mean curvature integrals of FnW2,nF_nW^{2,n}-sets.

Method maps imperfect simulations to observed stellar spectra using unsupervised domain adaptation.

problem Mapping from large sets of imperfect simulations and observational data.
method Adversarial autoencoders, cycle-consistency constraint, and generative surrogate physics emulator network.
result Reconstructed spectra quality and discovery of new spectral features.

The paper optimizes investment strategies with constraints for life-cycle models.

problem Maximizing consumption, death benefit, and wealth under trading constraints.
method Deep pricing kernel approach to solve constrained portfolio optimization.
result Individuals reduce consumption, insurance demand, and wealth due to constraints.

The paper analyzes CycleGAN's error components for unpaired data generation.

problem Analyzing approximation and estimation errors in CycleGAN for unpaired data.
method Decomposes risk into approximation and estimation errors, analyzing each separately and considering their trade-offs.
result Theoretical insights into CycleGAN's performance through error analysis.

In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal form changes only in the obvious way under cycling and decycling. It is also shown …

2006-05-09abs ↗pdf ↗

TemperatureGAN generates hourly atmospheric temperature data with high fidelity.

problem Generating accurate hourly atmospheric temperature data for climate risk assessment.
method Generative Adversarial Network (GAN) conditioned on months, locations, and time periods.
result TemperatureGAN produces high-fidelity hourly atmospheric temperature data with good spatial and temporal consistency.

Paper studies simplified trisections and their equivalence classes.

problem Understanding right-left equivalence of simplified (2,0)(2, 0)-trisections.
method Analyzes simplified trisection diagrams and upper-triangular handle-slides.
result At least two simplified (2,0)(2, 0)-trisections can be right-left equivalent without being related by automorphisms or handle-slides.