ID: 2308.11355

Machine learning assisted exploration for affine Deligne-Lusztig varieties

August 22, 2023

View on ArXiv

Similar papers 4

Resolving the Geometric Locus Dilemma for Support Vector Learning Machines

November 16, 2015

83% Match
Denise M. Reeves
Machine Learning
Machine Learning

Capacity control, the bias/variance dilemma, and learning unknown functions from data, are all concerned with identifying effective and consistent fits of unknown geometric loci to random data points. A geometric locus is a curve or surface formed by points, all of which possess some uniform property. A geometric locus of an algebraic equation is the set of points whose coordinates are solutions of the equation. Any given curve or surface must pass through each point on a spe...

Find SimilarView on arXiv

Approximate Vanishing Ideal via Data Knotting

January 29, 2018

83% Match
Hiroshi Kera, Yoshihiko Hasegawa
Machine Learning

The vanishing ideal is a set of polynomials that takes zero value on the given data points. Originally proposed in computer algebra, the vanishing ideal has been recently exploited for extracting the nonlinear structures of data in many applications. To avoid overfitting to noisy data, the polynomials are often designed to approximately rather than exactly equal zero on the designated data. Although such approximations empirically demonstrate high performance, the sound algeb...

Find SimilarView on arXiv

Data Mining and Machine Learning in Astronomy

June 11, 2009

82% Match
Nicholas M. Ball, Robert J. Brunner
Instrumentation and Methods ...
Cosmology and Nongalactic As...

We review the current state of data mining and machine learning in astronomy. 'Data Mining' can have a somewhat mixed connotation from the point of view of a researcher in this field. If used correctly, it can be a powerful approach, holding the potential to fully exploit the exponentially increasing amount of available data, promising great scientific advance. However, if misused, it can be little more than the black-box application of complex computing algorithms that may g...

Find SimilarView on arXiv

Visual Knowledge Discovery with General Line Coordinates

May 28, 2023

82% Match
Lincoln Huber, Boris Kovalerchuk, Charles Recaido
Machine Learning
Human-Computer Interaction

Understanding black-box Machine Learning methods on multidimensional data is a key challenge in Machine Learning. While many powerful Machine Learning methods already exist, these methods are often unexplainable or perform poorly on complex data. This paper proposes visual knowledge discovery approaches based on several forms of lossless General Line Coordinates. These are an expansion of the previously introduced General Line Coordinates Linear and Dynamic Scaffolding Coordi...

Find SimilarView on arXiv

Filtrated Algebraic Subspace Clustering

June 20, 2015

82% Match
Manolis C. Tsakiris, Rene Vidal
Computer Vision and Pattern ...

Subspace clustering is the problem of clustering data that lie close to a union of linear subspaces. In the abstract form of the problem, where no noise or other corruptions are present, the data are assumed to lie in general position inside the algebraic variety of a union of subspaces, and the objective is to decompose the variety into its constituent subspaces. Prior algebraic-geometric approaches to this problem require the subspaces to be of equal dimension, or the numbe...

Find SimilarView on arXiv

IGANN Sparse: Bridging Sparsity and Interpretability with Non-linear Insight

March 17, 2024

82% Match
Theodor Stoecker, Nico Hambauer, ... , Kraus Mathias
Machine Learning
Artificial Intelligence
Computers and Society

Feature selection is a critical component in predictive analytics that significantly affects the prediction accuracy and interpretability of models. Intrinsic methods for feature selection are built directly into model learning, providing a fast and attractive option for large amounts of data. Machine learning algorithms, such as penalized regression models (e.g., lasso) are the most common choice when it comes to in-built feature selection. However, they fail to capture non-...

Find SimilarView on arXiv

Beyond Euclid: An Illustrated Guide to Modern Machine Learning with Geometric, Topological, and Algebraic Structures

July 12, 2024

82% Match
Sophia Sanborn, Johan Mathe, Mathilde Papillon, Domas Buracas, Hansen J Lillemark, Christian Shewmake, Abby Bertics, ... , Miolane Nina
Machine Learning

The enduring legacy of Euclidean geometry underpins classical machine learning, which, for decades, has been primarily developed for data lying in Euclidean space. Yet, modern machine learning increasingly encounters richly structured data that is inherently nonEuclidean. This data can exhibit intricate geometric, topological and algebraic structure: from the geometry of the curvature of space-time, to topologically complex interactions between neurons in the brain, to the al...

Find SimilarView on arXiv

Machine learning for complete intersection Calabi-Yau manifolds: a methodological study

July 30, 2020

82% Match
Harold Erbin, Riccardo Finotello
Machine Learning
Algebraic Geometry

We revisit the question of predicting both Hodge numbers $h^{1,1}$ and $h^{2,1}$ of complete intersection Calabi-Yau (CICY) 3-folds using machine learning (ML), considering both the old and new datasets built respectively by Candelas-Dale-Lutken-Schimmrigk / Green-H\"ubsch-Lutken and by Anderson-Gao-Gray-Lee. In real world applications, implementing a ML system rarely reduces to feed the brute data to the algorithm. Instead, the typical workflow starts with an exploratory dat...

Find SimilarView on arXiv

Advancements in Research Mathematics through AI: A Framework for Conjecturing

June 22, 2023

82% Match
Randy Davila
Combinatorics
History and Overview

In the words of the esteemed mathematician Paul Erd\"os, the mathematician's task is to \emph{prove and conjecture}. These two processes form the bedrock of all mathematical endeavours, and in the recent years, the mathematical community has increasingly sought the assistance of computers to bolster these tasks. This paper is a testament to that pursuit; it presents a robust framework enabling a computer to automatically generate conjectures - particularly those conjectures t...

Find SimilarView on arXiv

Algebraic Machine Learning

March 14, 2018

82% Match
Fernando Martin-Maroto, Polavieja Gonzalo G. de
Machine Learning
Discrete Mathematics
Commutative Algebra
Rings and Algebras

Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to other datasets. To achieve generalization something else is needed, for example a regularization method or stopping the training when error in a validation dataset is minimal. Here we propose a different approach to learning and generaliza...

Find SimilarView on arXiv