arXiv subjects

Yeon Hyang Kim

Publications and source records attributed to Yeon Hyang Kim.

7 recordsLinked to original sources

arXiv2025

Dual Frame Completion Problem

In this paper we present the construction of an exact dual frame under specific structural assumptions posed on the dual frame. When given a frame $F$ for a finite dimensional Hilbert space, and a set of vectors $H$ that is assumed to be a subset of a dual frame of $F$, we answer the following question: Which dual frame $G$ for $F$ - if it exists - completes the given set $H$? Solutions are explored through a direct and an indirect approach, as well as via the singular value decomposition of the synthesis operator of $F$.

math.FA↗

arXiv2020

Solomon at SemEval-2020 Task 11: Ensemble Architecture for Fine-Tuned Propaganda Detection in News Articles

This paper describes our system (Solomon) details and results of participation in the SemEval 2020 Task 11 "Detection of Propaganda Techniques in News Articles"\cite{DaSanMartinoSemeval20task11}. We participated in Task "Technique Classification" (TC) which is a multi-class classification task. To address the TC task, we used RoBERTa based transformer architecture for fine-tuning on the propaganda dataset. The predictions of RoBERTa were further fine-tuned by class-dependent-minority-class classifiers. A special classifier, which employs dynamically adapted Least Common Sub-sequence algorithm, is used to adapt to the intricacies of repetition class. Compared to the other participating systems, our submission is ranked 4th on the leaderboard.

cs.CL↗

arXiv2016

Scalability of frames generated by dynamical operators

Let $A$ be an operator on {a separable } Hilbert space $\cH$, and let $G \subset \cH$. It is known that - under appropriate conditions on $A$ and $G$ - the set of iterations $F_G(A)= \{A^j \gbf \; | \; \gbf \in G, \; 0 \leq j \leq L(\gbf) \} $ is a frame for $\cH$. We call $F_G(A)$ a dynamical frame for $\cH$, and explore further its properties; in particular, we show that the canonical dual frame of $F_G(A)$ also has an iterative set structure. We explore the relations between the operator $A$, the set $G$ and the number of iterations $L$ which ensure that the system $F_G(A)$ is a scalable frame. We give a general statement on frame scalability, We and study in detail the case when $A$ is a normal operator, utilizing the unitary diagonalization in finite dimensions. In addition, we answer the question of when $F_G(A)$ is a scalable frame in several special cases involving block-diagonal and companion operators.

math.FA↗

arXiv2016

Minimal scalings and structural properties of scalable frames

For a unit-norm frame $F = \{f_i\}_{i=1}^k$ in $\R^n$, a scaling is a vector $c=(c(1),\dots,c(k))\in \R_{\geq 0}^k$ such that $\{\sqrt{c(i)}f_i\}_{i =1}^k$ is a Parseval frame in $\R^n$. If such a scaling exists, $F$ is said to be scalable. A scaling $c$ is a minimal scaling if $\{f_i : c(i)>0\}$ has no proper scalable subframe. It is known that the set of all scalings of $F$ is a convex polytope whose vertices correspond to minimal scalings. In this paper, we provide an estimation of the number of minimal scalings of a scalable frame and a characterization of when minimal scalings are affinely dependent. Using this characterization, we can conclude that all strict scalings $c=(c(1),\dots,c(k))\in \R_{> 0}^k$ of $F$ have the same structural property. We also present the uniqueness of orthogonal partitioning property of any set of minimal scalings, which provides all possible tight subframes of a given scaled frame.

math.FA↗

arXiv2014

Factor posets of frames and dual frames in finite dimensions

We consider frames in a finite-dimensional Hilbert space where frames are exactly the spanning sets of the vector space. A factor poset of a frame is defined to be a collection of subsets of $I$, the index set of our vectors, ordered by inclusion so that nonempty $J \subseteq I$ is in the factor poset if and only if $\{f_i\}_{i \in J}$ is a tight frame. We first study when a poset $P\subseteq 2^I$ is a factor poset of a frame and then relate the two topics by discussing the connections between the factor posets of frames and their duals. Additionally we discuss duals with regard to $\ell^p$ minimization.

math.FA↗

arXiv2013

Diagram vectors and Tight Frame Scaling in Finite Dimensions

We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. The diagram vector of a vector in R2 was previously defined using polar coordinates and was used to characterize tight frames in R2 in a geometric fashion. Reformulating the definition of a diagram vector in R2 we provide a natural extension of this notion to Rn and Cn. Using the diagram vectors we give a characterization of tight frames in Rn or Cn. Further we provide a characterization of when a unit-norm frame in Rn or Cn can be scaled to a tight frame. This classification allows us to determine all scaling coefficients that make a unit-norm frame into a tight frame.

math.FA↗

arXiv2013

Maximum Robustness and Surgery of Frames in finite dimensions

We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. We present a method to determine the maximum robustness of a frame. We present results on tight subframes and surgery of frames. We also answer the question of when length surgery resulting in a tight frame set for Hn is possible.

math.FA↗