Searcharxiv⌕ Search

arXiv subjects

Tirasan Khandhawit

Publications and source records attributed to Tirasan Khandhawit.

13 recordsLinked to original sources

Decom-Renorm-Merge: Model Merging on the Right Space Improves Multitasking

In the era of large-scale training, model merging has evolved into a tool for creating multitasking models efficiently. It enables the knowledge of models to be fused, without the need for heavy computation as required in traditional multitask learning. Existing merging methods often assume that entries at identical positions in weight matrices serve the same function, enabling straightforward entry-wise comparison and merging. However, this assumption overlooks the complexity of finetuned neural networks, where neurons may develop distinct feature compositions, making direct entry-wise merging problematic. We present Decom-Renorm-Merge (DRM), a simple yet effective approach that leverages Singular Value Decomposition to decompose and coordinate weight matrices into an aligned joint space, where entry-wise merging becomes possible. We showcase the effectiveness of DRM across various settings ranging from smaller encoder-based such as ViT and DeBERTa, encoder-decoder-based such as T5, and larger decoder-based such as Llama3.1-8B. Our experimental results show that DRM outperforms several state-of-the-art merging techniques across full finetuning and low-rank adaptation settings. Moreover, our analysis reveals renormalization as the crucial component for creating a robust and even joint space for merging, significantly contributing to the method's performance.

cs.LG↗

Biquandles, quivers and virtual bridge indices

We investigate connections between biquandle colorings, quiver enhancements, and several notions of the bridge numbers $b_i(K)$ for virtual links, where $i=1,2$. We show that for any positive integers $m \leq n$, there exists a virtual link $K$ with $b_1(K) = m$ and $b_2(K) = n$, thereby answering a question posed by Nakanishi and Satoh. In some sense, this gap between the two formulations measures how far the knot is from being classical. We also use these bridge number analyses to systematically construct families of links in which quiver invariants can distinguish between links that share the same biquandle counting invariant.

math.GT↗

Planar stick indices of some knotted graphs

Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum number of straight sticks needed for its construction in 3-space. In this paper, we give estimates of this quantity by enumerating stick diagrams in a plane. In particular, we compute the planar stick indices of knotted graphs with low crossing numbers. We also show that if a bouquet graph or a theta-curve has the property that its proper subgraphs are all trivial, then the planar stick index must be at least seven.

math.CO↗

Quandle coloring quivers and 2-bridge links

The quandle coloring quiver was introduced by Cho and Nelson as a categorification of the quandle coloring number. In some cases, it has been shown that the quiver invariant offers more information than other quandle enhancements. In this paper, we compute the quandle coloring quivers of 2-bridge links with respect to the dihedral quandles.

math.QA↗

Superbridge and Bridge Indices for Knots

We improve the upper bound on the superbridge index $sb[K]$ of a knot type $[K]$ in terms of the bridge index $b[K]$ from $sb[K] \leq 5b -3$ to $sb[K]\leq 3b[k] - 1$.

math.GT↗

Unfolded Seiberg-Witten Floer spectra, I: Definition and invariance

Let $Y$ be a closed and oriented $3$-manifold. We define different versions of unfolded Seiberg-Witten Floer spectra for $Y$. These invariants generalize Manolescu's Seiberg-Witten Floer spectrum for rational homology $3$-spheres. We also compute some examples when $Y$ is a Seifert space.

math.GT↗

A new gauge slice for the relative Bauer-Furuta invariants

In this paper, we study Manolescu's construction of the relative Bauer-Furuta invariants arising from the Seiberg-Witten equations on 4-manifolds with boundary. The main goal is to introduce a new gauge fixing condition in order to apply the finite dimensional approximation technique. We also hope to provide a framework to extend Manolescu's construction to general 4-manifolds.

math.GT↗

On the stable Conley index in Hilbert spaces

In this paper, we study Conley theory in Hilbert spaces and make some refinement of the construction of the stable Conley index developed by Gȩba, Izydorek, and Pruszko. For instance, we allow subspaces other than invariant subspaces in the the construction. As a main result, we show that the resulting stable Conley index for a given isolating neighborhood of a flow does not depend on choices in the construction. We also hope that some results can be applied to the construction of Floer homotopy type.

math.DS↗

Lower Bound for Convex Hull Area and Universal Cover Problems

In this paper, we provide a lower bound for an area of the convex hull of points and a rectangle in a plane. We then apply this estimate to establish a lower bound for a universal cover problem. We showed that a convex universal cover for a unit length curve has area at least 0.232239. In addition, we show that a convex universal cover for a unit closed curve has area at least 0.0879873.

math.MG↗

Chomp on Graphs and Subsets

The game subset take-away begins with a simplicial complex Δ. Two players take turns removing any element of Δas well as all other elements which contain it, and the last player able to move wins. Graph Chomp is a special case of subset take-away played on a simplicial complex with only vertices and edges. The game has previously only been analyzed for complete graphs, forest graphs, and very small special cases of higher-dimensional simplicial complexes. We generalize a common method of reducing some game positions to simpler ones by symmetry and provide a complete analysis of complete n-partite graphs for arbitrary n and all bipartite graphs. Finally, we give partial results for odd-cycle pseudotrees, which are non-bipartite graphs with a single cycle.

math.CO↗

An Improved Lower Bound for Moser's Worm Problem

We show that any convex region which contains a unit segment, an equilateral triangle of sides 1/2, and a square of side 1/3 always has area at least 0.227498. Using grid-search algorithm, we attempt to find a configuration of these three objects with minimal convex hull area. Consequently, we improve a lower bound for Moser's worm problem from 0.2194 to 0.227498.

math.MG↗

A family of transversely nonsimple knots

We apply knot Floer homology to exhibit an infinite family of transversely nonsimple prime knots starting with $10_{132}$. We also discuss the combinatorial relationship between grid diagrams, braids, and Legendrian and transverse knots in standard contact $\mathbb{R}^3$.

math.GT↗