representative point
- Asia > China (0.04)
- North America > United States > Massachusetts > Middlesex County > Cambridge (0.04)
- North America > United States > District of Columbia > Washington (0.04)
- (2 more...)
- North America > United States > California > San Francisco County > San Francisco (0.28)
- Europe > Austria (0.04)
- Asia > China > Zhejiang Province > Hangzhou (0.04)
- (7 more...)
- Information Technology > Artificial Intelligence > Machine Learning > Neural Networks > Deep Learning (1.00)
- Information Technology > Artificial Intelligence > Representation & Reasoning (0.94)
- Information Technology > Artificial Intelligence > Machine Learning > Statistical Learning (0.68)
- Information Technology > Data Science > Data Mining (0.68)
Efficient Computation of a Continuous Topological Model of the Configuration Space of Tethered Mobile Robots
Battocletti, Gianpietro, Boskos, Dimitris, De Schutter, Bart
Despite the attention that the problem of path planning for tethered robots has garnered in the past few decades, the approaches proposed to solve it typically rely on a discrete representation of the configuration space and do not exploit a model that can simultaneously capture the topological information of the tether and the continuous location of the robot. In this work, we explicitly build a topological model of the configuration space of a tethered robot starting from a polygonal representation of the workspace where the robot moves. To do so, we first establish a link between the configuration space of the tethered robot and the universal covering space of the workspace, and then we exploit this link to develop an algorithm to compute a simplicial complex model of the configuration space. We show how this approach improves the performances of existing algorithms that build other types of representations of the configuration space. The proposed model can be computed in a fraction of the time required to build traditional homotopy-augmented graphs, and is continuous, allowing to solve the path planning task for tethered robots using a broad set of path planning algorithms.
- Europe > Netherlands > South Holland > Delft (0.04)
- Europe > United Kingdom > England > Cambridgeshire > Cambridge (0.04)
- North America > United States > California > Los Angeles County > Long Beach (0.04)
- Europe > Norway > Eastern Norway > Oslo (0.04)
- Asia > Middle East > Jordan (0.04)
- Workflow (0.46)
- Research Report > New Finding (0.46)
- Information Technology > Data Science > Data Mining (1.00)
- Information Technology > Artificial Intelligence > Representation & Reasoning (1.00)
- Information Technology > Artificial Intelligence > Machine Learning > Neural Networks (0.69)
- Information Technology > Artificial Intelligence > Machine Learning > Statistical Learning > Clustering (0.47)
- Asia > China (0.04)
- North America > United States > Massachusetts > Middlesex County > Cambridge (0.04)
- North America > United States > District of Columbia > Washington (0.04)
- (2 more...)
- North America > United States > California > San Francisco County > San Francisco (0.28)
- Europe > Austria (0.04)
- Asia > China > Zhejiang Province > Hangzhou (0.04)
- (7 more...)
- Information Technology > Artificial Intelligence > Machine Learning > Neural Networks > Deep Learning (1.00)
- Information Technology > Artificial Intelligence > Representation & Reasoning (0.94)
- Information Technology > Artificial Intelligence > Machine Learning > Statistical Learning (0.68)
- Information Technology > Data Science > Data Mining (0.68)
while A.3 is a common assumption in linear regression analysis and it relates to the LARS problem in our online
We thank all the reviewers for carefully reading of the manuscript and constructive comments. Reviewer #1: Assumptions A.2 and A.3 used in Algorithm 2. Reviewer #3: There seem to be several misunderstandings regarding the steps of our algorithm and its analysis. To maintain the list constant, for every added point another point is removed.
- Research Report > New Finding (0.52)
- Research Report > Experimental Study (0.41)
- North America > United States > California > Los Angeles County > Long Beach (0.04)
- Europe > Norway > Eastern Norway > Oslo (0.04)
- Asia > Middle East > Jordan (0.04)
- Workflow (0.46)
- Research Report > New Finding (0.46)
- Information Technology > Data Science > Data Mining (1.00)
- Information Technology > Artificial Intelligence > Representation & Reasoning (1.00)
- Information Technology > Artificial Intelligence > Machine Learning > Neural Networks (0.69)
- Information Technology > Artificial Intelligence > Machine Learning > Statistical Learning > Clustering (0.47)
Latent Space Interpretation for Stylistic Analysis and Explainable Authorship Attribution
Alshomary, Milad, Ri, Narutatsu, Apidianaki, Marianna, Patel, Ajay, Muresan, Smaranda, McKeown, Kathleen
Recent state-of-the-art authorship attribution methods learn authorship representations of texts in a latent, non-interpretable space, hindering their usability in real-world applications. Our work proposes a novel approach to interpreting these learned embeddings by identifying representative points in the latent space and utilizing LLMs to generate informative natural language descriptions of the writing style of each point. We evaluate the alignment of our interpretable space with the latent one and find that it achieves the best prediction agreement compared to other baselines. Additionally, we conduct a human evaluation to assess the quality of these style descriptions, validating their utility as explanations for the latent space. Finally, we investigate whether human performance on the challenging AA task improves when aided by our system's explanations, finding an average improvement of around +20% in accuracy.
- North America > United States > Pennsylvania > Philadelphia County > Philadelphia (0.14)
- Europe > Ireland > Leinster > County Dublin > Dublin (0.04)
- North America > United States > New York > New York County > New York City (0.04)
- (3 more...)