Generalized Penalty for Circular Coordinate Representation
Topological Data Analysis (TDA) provides novel approaches that allow us to analyze the geometrical shapes and topological structures of a dataset. As one important application, TDA can be used for data visualization and dimension reduction. We follow the framework of circular coordinate representation, which allows us to perform dimension reduction and visualization for high-dimensional datasets on a torus using persistent cohomology. In this paper, we propose a method to adapt the circular coordinate framework to take into account the roughness of circular coordinates in change-point and high-dimensional applications. We use a generalized penalty function instead of an $L_{2}$ penalty in the traditional circular coordinate algorithm. We provide simulation experiments and real data analysis to support our claim that circular coordinates with generalized penalty will detect the change in high-dimensional datasets under different sampling schemes while preserving the topological structures.
Code (1)
Tasks
Data VisualizationDimensionality ReductionTopological Data AnalysisSimilar Papers 제목 키워드 기반
Circular Coordinate Methods with Generalized Penalty Functions
The circular coordinate representation performs dimension reduction and visualization for high-dimensional datasets on a torus using persistent cohomology. In this work, we propose a method to adapt the circular coordina…
Dimensionality ReductionStop Unnecessary Reflection: Training LRMs for Efficient Reasoning with Adaptive Reflection and Length Coordinated Penalty
Large Reasoning Models (LRMs) have demonstrated remarkable performance on complex reasoning tasks by employing test-time scaling. However, they often generate over-long chains-of-thought that, driven by substantial refle…
Reinforcement LearningMathematical ReasoningSynthetic Data Generation and Automated Multidimensional Data Labeling for AI/ML in General and Circular Coordinates
Insufficient amounts of available training data is a critical challenge for both development and deployment of artificial intelligence and machine learning (AI/ML) models. This paper proposes a unified approach to both s…
Outlier DetectionSynthetic Data GenerationThe Trimmed Lasso: Sparsity and Robustness
Nonconvex penalty methods for sparse modeling in linear regression have been a topic of fervent interest in recent years. Herein, we study a family of nonconvex penalty functions that we call the trimmed Lasso and that o…
Trigonometric Moments of a Generalized von Mises Distribution in 2-D Range-Only Tracking
A 2D range-only tracking scenario is non-trivial due to two main reasons. First, when the states to be estimated are in Cartesian coordinates, the uncertainty region is multi-modal. The second reason is that the probabil…