Searcharxiv⌕ Search

arXiv subjects

Shida Wang

Publications and source records attributed to Shida Wang.

26 records · Page 2Linked to original sources

Improve Long-term Memory Learning Through Rescaling the Error Temporally

This paper studies the error metric selection for long-term memory learning in sequence modelling. We examine the bias towards short-term memory in commonly used errors, including mean absolute/squared error. Our findings show that all temporally positive-weighted errors are biased towards short-term memory in learning linear functionals. To reduce this bias and improve long-term memory learning, we propose the use of a temporally rescaled error. In addition to reducing the bias towards short-term memory, this approach can also alleviate the vanishing gradient issue. We conduct numerical experiments on different long-memory tasks and sequence models to validate our claims. Numerical results confirm the importance of appropriate temporally rescaled error for effective long-term memory learning. To the best of our knowledge, this is the first work that quantitatively analyzes different errors' memory bias towards short-term memory in sequence modelling.

cs.LG↗

A Brief Survey on the Approximation Theory for Sequence Modelling

We survey current developments in the approximation theory of sequence modelling in machine learning. Particular emphasis is placed on classifying existing results for various model architectures through the lens of classical approximation paradigms, and the insights one can gain from these results. We also outline some future research directions towards building a theory of sequence modelling.

cs.LG↗

A note on the concordance invariant epsilon

We compare the smooth concordance invariants Upsilon, phi and epsilon. Previous work gave examples of knots with one of the Upsilon and phi invariants zero but the epsilon invariant nonzero. We build an infinite family of linearly independent knots with both the Upsilon and phi invariants zero but the epsilon invariant nonzero.

math.GT↗

A note on the concordance invariants Upsilon and phi

Dai, Hom, Stoffregen and Truong defined a family of concordance invariants $φ_j$. The example of a knot with zero Upsilon invariant but nonzero epsilon invariant previously given by Hom also has nonzero phi invariant. We show there are infinitely many such knots that are linearly independent in the smooth concordance group. In the opposite direction, we build infinite families of linearly independent knots with zero phi invariant but nonzero Upsilon invariant. We also give a recursive formula for the phi invariant of torus knots.

math.GT↗

Semigroups of L-space knots and nonalgebraic iterated torus knots

Algebraic knots are known to be iterated torus knots and to admit L-space surgeries. However, Hedden proved that there are iterated torus knots that admit L-space surgeries but are not algebraic. We present an infinite family of such examples, with the additional property that no nontrivial linear combination of knots in this family is concordant to a linear combination of algebraic knots. The proof uses the Ozsvath-Stipsicz-Szabo Upsilon function, and also introduces a new invariant of L-space knots, the formal semigroup.

math.GT↗

The genus filtration in the smooth concordance group

We define a filtration of the smooth concordance group based on the genus of representative knots. We use the Heegaard Floer epsilon and Upsilon invariants to prove the quotient groups with respect to this filtration are infinitely generated. Results are applied to three infinite families of topologically slice knots.

math.GT↗

On the First Singularity for the Upsilon Invariant of Algebraic Knots

We show that the location of the first singularity of the Upsilon function of an algebraic knot is determined by the first term of its Puiseux characteristic sequence. In many cases this gives better bounds than the tau invariant on the genus of a cobordism between algebraic knots.

math.GT↗