Search results for "Machine learning"
showing 10 items of 1464 documents
Complex group algebras of finite groups: Brauer’s Problem 1
2005
Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.
Learning spatial filters for multispectral image segmentation.
2010
International audience; We present a novel filtering method for multispectral satel- lite image classification. The proposed method learns a set of spatial filters that maximize class separability of binary support vector machine (SVM) through a gradient descent approach. Regularization issues are discussed in detail and a Frobenius-norm regularization is proposed to efficiently exclude uninformative filters coefficients. Experiments car- ried out on multiclass one-against-all classification and tar- get detection show the capabilities of the learned spatial fil- ters.
Neutral-Current Neutrino-Nucleus Scattering off Xe Isotopes
2018
Large liquid xenon detectors aiming for dark matter direct detection will soon become viable tools also for investigating neutrino physics. Information on the effects of nuclear structure in neutrino-nucleus scattering can be important in distinguishing neutrino backgrounds in such detectors. We perform calculations for differential and total cross sections of neutral-current neutrino scattering off the most abundant xenon isotopes. The nuclear structure calculations are made in the nuclear shell model for elastic scattering, and also in the quasiparticle random-phase approximation (QRPA) and microscopic quasiparticle phonon model (MQPM) for both elastic and inelastic scattering. Using suit…
Support Vector Machine and Kernel Classification Algorithms
2018
This chapter introduces the basics of support vector machine (SVM) and other kernel classifiers for pattern recognition and detection. It also introduces the main elements and concept underlying the successful binary SVM. The chapter starts by introducing the main elements and concept underlying the successful binary SVM. Next, it introduces more advanced topics in SVM for classification, including large margin filtering (LMF), SSL, active learning, and large‐scale classification using SVMs. The LMF method performs both signal filtering and classification simultaneously by learning the most appropriate filters. SSL with SVMs exploits the information contained in both labeled and unlabeled e…
Magnetic fields in heavy ion collisions: flow and charge transport
2020
At the earliest times after a heavy-ion collision, the magnetic field created by the spectator nucleons will generate an extremely strong, albeit rapidly decreasing in time, magnetic field. The impact of this magnetic field may have detectable consequences, and is believed to drive anomalous transport effects like the Chiral Magnetic Effect (CME). We detail an exploratory study on the effects of a dynamical magnetic field on the hydrodynamic medium created in the collisions of two ultrarelativistic heavy-ions, using the framework of numerical ideal MagnetoHydroDynamics (MHD) with the ECHO-QGP code. In this study, we consider a magnetic field captured in a conducting medium, where the conduc…
Thermodynamics of the Classical Planar Ferromagnet Close to the Zero-Temperature Critical Point: A Many-Body Approach
2012
We explore the low-temperature thermodynamic properties and crossovers of ad-dimensional classical planar Heisenberg ferromagnet in a longitudinal magnetic field close to its field-induced zero-temperature critical point by employing the two-time Green’s function formalism in classical statistical mechanics. By means of a classical Callen-like method for the magnetization and the Tyablikov-like decoupling procedure, we obtain, for anyd, a low-temperature critical scenario which is quite similar to the one found for the quantum counterpart. Remarkably, ford>2the discrimination between the two cases is found to be related to the different values of the shift exponent which governs the beha…
Learning by the Process of Elimination
2002
AbstractElimination of potential hypotheses is a fundamental component of many learning processes. In order to understand the nature of elimination, herein we study the following model of learning recursive functions from examples. On any target function, the learning machine has to eliminate all, save one, possible hypotheses such that the missing one correctly describes the target function. It turns out that this type of learning by the process of elimination (elm-learning, for short) can be stronger, weaker or of the same power as usual Gold style learning.While for usual learning any r.e. class of recursive functions can be learned in all of its numberings, this is no longer true for el…
Upport vector machines for nonlinear kernel ARMA system identification.
2006
Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA 2k) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based syste…
ORGANIZED LEARNING MODELS (PURSUER CONTROL OPTIMISATION)
1983
Abstract The concept of Organized Learning is defined, and some random models are presented. For Not Transferable Learning, it is necessary to start from an instantaneous learning; by a discrete way, we must form a stochastic model considering the probability of each path; with a continue aproximation, we can study the evolution of the internal state through to consider the relative and absolute probabilities, by means of differential equations systems. For Transferable Learning, the instantaneous learning give us directly the System evolution. So, the Algoritmes for the different models are compared.
Nonlinear Pulse Shaping in Optical Fibres with a Neural Network
2020
We use a supervised machine-learning model based on a neural network to solve the direct and inverse problems relating to the shaping of optical pulses that occurs upon nonlinear propagation in optical fibres.