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

1234 · Sep 201919922001200920172026
48 results for S^2xS^2

We consider the cosmetic surgery problem for two-bridge knots in the 3-sphere. It is seen that all the two-bridge knots at most 9 crossings other than 927=S(49,19)=C[2,2,2,2,2,2]9_{27} = S(49,19)=C[2,2,-2,2,2,-2] admits no purely cosmetic surgery pairs. Then we show that any two-bridge knot of the Conway form [2x,2,2x,2x,2,2x][2x,2,-2x,2x,2,-2x] with $x \ge …

2016-02-07abs ↗pdf ↗

A general study of minimal surfaces of the Riemannian product of two spheres S^2xS^2 is tackled. We stablish a local correspondence between (non-complex) minimal surfaces of S^2xS^2 and certain pair of minimal surfaces of the sphere S^3. This correspondence also allows us to link minimal surfaces in S^3 and in the Riem…

2013-01-08abs ↗pdf ↗

A smooth five-dimensional s-cobordism becomes a smooth product if stabilized by a finite number n of S2xS2x[0,1]S^2xS^2x[0,1]'s. We show that for amenable fundamental groups, the minimal n is subextensive in covers, i.e., n(cover)/index(cover) has limit 0. We focus on the notion of sweepout width, which is a bridge between 4-di…

2015-03-18abs ↗pdf ↗

Two holomorphic Hopf differentials for surfaces of non-null parallel mean curvature vector in S^2xS^2 and H^2xH^2 are constructed. A 1:1 correspondence between these surfaces and pairs of constant mean curvature surfaces of S^2xR and H^2xR is established. Using that, surfaces with vanishing Hopf differentials (in parti…

2008-07-11abs ↗pdf ↗

Let M be a hyperkähler manifold. The S^2-family of complex structures compatible with the hyperkähler metric can be assembled into a single complex structure on Z=MxS^2; the resulting complex manifold is known as the twistor space of M. We describe the analogous construction for generalized complex structures in the se…

2013-09-18abs ↗pdf ↗

ETFs with 2x and 3x leverage underperformed the S&P 500 index due to compounding and volatility.

problem ETFs with higher leverage failed to match the performance of the underlying index.
method Analyzed the performance of leveraged ETFs compared to the S&P 500 index, accounting for compounding and volatility.
result Two-thirds of the underperformance was due to compounding and volatility, with the rest due to covariance.

Elliptic Chern characters and Atiyah-Witten formula generalized to double loop spaces.

problem Generalizing classical Atiyah-Witten formula to double loop spaces.
method Constructing elliptic Chern and Bismut-Chern characters, defining elliptic holonomy, and using equivariant twisted parallel transport.
result Established elliptic Atiyah-Witten formula on double loop space.

The main theorem of the paper shows that a smooth manifold which is homeomorphic to S^2xS^2 and has nonvanishing Ozsvath-Szabo invariant does not admit a perfect Morse function. I am withdrawing the paper because it is unclear to me if such a manifold exists.

2010-05-25abs ↗pdf ↗

In this article, we present new symplectic 4-manifolds with same integral cohomology as S2×S2S^{2}\times S^{2}. The generalization of this construction is given as well, an infinite family of symplectic 4-manifolds cohomology equivalent to $#_{(2g-1)}{(S^{2}\times S^{2})}$ for any g2g\geq 2. We also compute the Seiberg-Wi…

2006-11-06abs ↗pdf ↗

We develop a construction of Engel stuctures on 4-manifolds based on decompositions of manifolds into round handles. This allows us to show that all parallelizable 4-manifolds admit an Engel structure. We also show that, given two Engel manifolds M_1,M_2 satisfying a certain condition on the characteristic foliation, t…

2004-11-10abs ↗pdf ↗

A2SGD reduces distributed SGD communication to O(1) per worker.

problem Heavy communication costs in distributed SGD for large models.
method Two-level gradient averaging to consolidate gradients to two local averages.
result Achieves O(1) communication complexity per worker, significantly reducing traffic and training time.

D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest, but have been used for few real-world computations. Machine learning has been identified as an area where quantum annealing may be useful. Here, we show that the D-Wave 2X can be effectively used as part of an…

2017-04-05abs ↗pdf ↗

Let DD be an oriented link diagram with the set of regions rD\operatorname{r}_{D}. We define a symmetric map (or matrix) τD ⁣:rD×rDZ[x]\operatornameτ_{D}\colon\operatorname{r}_{D}\times \operatorname{r}_{D} \to \mathbb{Z}[x] that gives rise to an invariant of oriented links, based on a slightly modified SS-equivalence of Trotter…

2018-01-15abs ↗pdf ↗

We study a variation of Turaev's homotopy quantum field theories using 2-categories of surfaces. We define the homotopy surface 2-category of a space XX and define an $\cS_X$-structure to be a monoidal 2-functor from this to the 2-category of idempotent-complete additive kk-linear categories. We initiate the study of…

2001-11-07abs ↗pdf ↗

For any g>1 we construct a graph G_g in S^3 whose exterior M_g supports a complete finite-volume hyperbolic structure with one toric cusp and a connected geodesic boundary of genus g. We compute the canonical decomposition and the isometry group of M_g, showing in particular that any self-homeomorphism of M_g extends t…

2003-09-23abs ↗pdf ↗

This paper considers stochastic bandits with side observations, a model that accounts for both the exploration/exploitation dilemma and relationships between arms. In this setting, after pulling an arm i, the decision maker also observes the rewards for some other actions related to i. We will see that this model is su…

2012-10-16abs ↗pdf ↗

We classify all order one invariants of immersions of a closed orientable surface F into R^3, with values in an arbitrary Abelian group G. We show that for any F and G and any regular homotopy class A of immersions of F into R^3, the group of all order one invariants on A is isomorphic to G^\aleph_0 \oplus B \oplus B w…

2001-03-25abs ↗pdf ↗

This note is a study of nonnegativity conditions on curvature which are preserved by the Ricci flow. We focus on specific kinds of curvature conditions which we call noncoercive, these are the conditions for which nonnegative curvature and vanishing scalar curvature doesn't imply flatness. We show that, in dimensions g…

2013-08-06abs ↗pdf ↗

CURL uses contrastive learning to improve reinforcement learning performance.

problem Improving reinforcement learning performance on complex tasks.
method Contrastive learning to extract high-level features from raw pixels, followed by off-policy control.
result CURL outperforms prior methods on DeepMind Control Suite and Atari Games.

We present DiffTaichi, a new differentiable programming language tailored for building high-performance differentiable physical simulators. Based on an imperative programming language, DiffTaichi generates gradients of simulation steps using source code transformations that preserve arithmetic intensity and parallelism…

2019-10-01abs ↗pdf ↗

The study revisits Hopfield's associative memory model and calculates its capacity for two specific pattern basins.

problem Determining the capacity of a Hebbian-Hopfield network for storing binary patterns.
method Using fully lifted random duality theory and numerical analysis, the study calculates the capacity for two specific pattern basins.
result Explicit characterizations of the capacity for the AGS and NLT pattern basins, with remarkable fast lifting convergence.

Auto-decoder synthesizes graphs from latent codes.

problem Creating new graph structures from specified distributions.
method Generative model learns latent codes from empirical distribution. Self-attention identifies likely connectivity patterns. Graph-based normalizing flows sample latent codes.
result Model outperforms state of the art by 1.5x in accuracy and 2x in speed.

Study on random linear programs and their connection to mean widths of random polyhedrons.

problem Characterizing the objectives of random linear programs and their relation to mean widths of random polyhedrons.
method Utilizing random duality theory, the exact characterizations of linear objectives are obtained in a large dimensional context.
result The exact characterizations of the program's objectives are obtained, connecting the objectives to the mean widths of random polyhedrons.

The ever-increasing demand from mobile Machine Learning (ML) applications calls for evermore powerful on-chip computing resources. Mobile devices are empowered with heterogeneous multi-processor Systems-on-Chips (SoCs) to process ML workloads such as Convolutional Neural Network (CNN) inference. Mobile SoCs house sever…

2019-08-24abs ↗pdf ↗

We present the characterization of metric spaces that are micro-, macro- or bi-uniformly equivalent to the extended Cantor set $\{\sum_{i=-n}^\infty\frac{2x_i}{3^i}:n\in\IN ,\;(x_i)_{i\in\IZ}\in\{0,1\}^\IZ\}\subset\IR$, which is bi-uniformly equivalent to the Cantor bi-cube $2^{<\IZ}=\{(x_i)_{i\in\IZ}\in \{0,1\}^\IZ:\e…

2009-08-25abs ↗pdf ↗

Building agents to interact with the web would allow for significant improvements in knowledge understanding and representation learning. However, web navigation tasks are difficult for current deep reinforcement learning (RL) models due to the large discrete action space and the varying number of actions between the s…

2019-02-19abs ↗pdf ↗

Study of manifolds with flat connections and diagonal metrics leading to vanishing Euler characteristic.

problem Understanding the geometry and topology of affine-orthogonal manifolds.
method Deformation of flat connections into Levi-Civita connections and analysis of Euler characteristic.
result Deformations force the Euler characteristic to vanish, supporting Chern's conjecture.

Stochastic gradient descent (SGD) is a well known method for regression and classification tasks. However, it is an inherently sequential algorithm at each step, the processing of the current example depends on the parameters learned from the previous examples. Prior approaches to parallelizing linear learners using SG…

2017-05-22abs ↗pdf ↗