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,742 papers · 148 categories

Trend · papers per month

146291437582 · Jun 202019922001200920172026
48 results for efficient cycles

This paper identifies the unique efficient cycle for most hyperbolic manifolds but not for the figure-8 knot complement.

problem Identifying the unique efficient cycle for hyperbolic manifolds.
method Analyzing the limit of fundamental cycles and their 1\ell^1-norm convergence.
result The uniqueness of the efficient cycle is proven for most hyperbolic manifolds but not for the figure-8 knot complement.

Originally, the Carnot cycle is a theoretical thermodynamic cycle that provides an upper limit on the efficiency that any classical thermodynamic engine can achieve during the conversion of heat into work, or conversely, the efficiency of a refrigeration system in creating a temperature difference by the application of…

2018-11-06abs ↗pdf ↗

By Gromov's mapping theorem for bounded cohomology, the projection of a group to the quotient by an amenable normal subgroup is isometric on group homology with respect to the 1\ell^1-semi-norm. Gromov's description of the diffusion of cycles also implicitly produces efficient cycles in this situation. We present an e…

2017-04-18abs ↗pdf ↗

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.

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 ↗

Proposes a new method for completing swap cycles in decentralized exchanges.

problem Completing swap cycles in decentralized exchanges efficiently and without slippage.
method Introduces an asset matrix formulation to verify and complete CoW cycles using graph traversal and imbalance correction.
result Demonstrates efficient discovery and insertion of synthetic orders for atomic cycle closure.

This paper uses spectrum analysis to understand price behavior in the Indian stock market.

problem Understanding price formation and discovery in the Indian stock market.
method Adapting mathematical physics theories and spectrum analysis to decompose price cycles.
result Decomposing price cycles helps in understanding the effect of information on price formation and discovery.

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.

This research creates efficient models for cyclo-stationary systems using generative methods.

problem Efficiently modeling systems with periodic forcing.
method Score-based generative modeling for reduced-order models.
result Accurately reproduces statistical properties and temporal correlations of cyclo-stationary time series.

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.

Let N be a manifold (with boundary) of dimension at least 3, such that its interior admits a hyperbolic metric of finite volume. We discuss the possible limits arising from sequences of relative fundamental cycles approximating the simplicial volume. As applications, we extend results of Jungreis and Calegari from clos…

2000-07-01abs ↗pdf ↗

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 ↗

This research integrates human interaction into reinforcement learning to improve sample efficiency and real-time learning.

problem Current reinforcement learning requires thousands of samples to converge, and is prone to catastrophic failures.
method Integrates human interaction modalities (demonstrations, interventions, evaluations) into the reinforcement learning loop.
result Human interaction accelerates learning and improves sample efficiency.

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.

NPOD algorithm improves efficiency in estimating pharmacokinetic parameters.

problem Efficiently estimating joint distribution of model parameters in population pharmacokinetics.
method Uses gradient approach to suggest new support points, reducing evaluation time.
result Achieves similar solutions to NPAG but with significantly fewer cycles and runtime.

While loopy belief propagation (LBP) performs reasonably well for inference in some Gaussian graphical models with cycles, its performance is unsatisfactory for many others. In particular for some models LBP does not converge, and in general when it does converge, the computed variances are incorrect (except for cycle-…

2011-05-10abs ↗pdf ↗

This work introduces novel methods to identify and compare cycles across topological objects.

problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.

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 the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a …

2011-06-14abs ↗pdf ↗

Smooth approximation of integral cycles mod 2 in Riemannian manifolds.

problem Approximating mod 2 integral cycles by smooth submanifolds.
method Approximation of mod 2 integral cycles by smooth submanifolds with controlled singularities.
result Every mod 2 integral cycle can be approximated by a smooth submanifold with a controlled singular set.

We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can…

2011-04-06abs ↗pdf ↗

Constructs an explicit cycle in arithmetic group cohomology.

problem Cohomology of SLn(Z)_n(\mathbb{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.

Using Kontsevich's identification of the homology of the Lie algebra l_infty with the cohomology of Out(F_r), Morita defined a sequence of 4k-dimensional classes mu_k in the unstable rational homology of Out(F_{2k+2}). He showed by a computer calculation that the first of these is non-trivial, so coincides with the uni…

2004-06-19abs ↗pdf ↗

We introduce a notion of vanishing Maslov index for lagrangian varifolds and lagrangian integral cycles in a Calabi-Yau manifold. We construct mass-decreasing flows of lagrangian varifolds and lagrangian cycles which satisfy this condition. The flow of cycles converges, at infinite time, to a sum of special lagrangian …

2016-06-08abs ↗pdf ↗

Study examines cash conversion cycle in manufacturing firms, finding negative relationships with profitability and size.

problem Understanding cash conversion cycle in manufacturing firms and its impact on profitability and size.
method Empirical study of 30 manufacturing firms in Dhaka Stock Exchanges, categorizing them into six industries, analyzing industry averages and relationships with size and profitability.
result Negative relationship between cash conversion cycle and profitability, especially ROE; negative relationship with firm size in terms of net sales.

By generalizing the measurements on the game experiments of mixed strategy Nash equilibrium, we study the dynamical pattern in a representative dynamic stochastic general equilibrium (DSGE). The DSGE model describes the entanglements of the three variables (output gap [yy], inflation [ππ] and nominal interest rate [$…

2014-10-30abs ↗pdf ↗

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of contractible Hamiltonian cycle in equivelar triangulated maps. We also present an alg…

2014-05-07abs ↗pdf ↗

Endogenous business cycles explain higher comovement across countries.

problem Standard models struggle to explain high comovement in business cycles across countries.
method Developed a demand-driven reduced-form model with strategic complementarities and international trade linkages.
result Combining endogenous business cycles with exogenous shocks matches empirical comovement levels.

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.

The current article studies certain problems related to complex cycles of holomorphic foliations with singularities in the complex plane. We focus on the case when polynomial differential one-form gives rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a nontrivial element of the f…

2010-05-11abs ↗pdf ↗

Let MM be a closed Riemannian surface of genus gg. We construct a family of 1-cycles on MM that represents a non-trivial element of the k'th homology group of the space of cycles and such that the mass of each cycle is bounded above by Cmax{k,g}Area(M)C \max\{\sqrt{k}, \sqrt{g}\} \sqrt{Area(M)}. This result is optimal up to a mul…

2014-10-30abs ↗pdf ↗