Marcello Sanguineti

Marcello Sanguineti

Auto-generated profile, based on publicly available information

Marcello Sanguineti

University of Genoa

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2012 in Journal of Hydrology
Verified
Journal Article
Closed access
MDMassimiliano Degiorgis
Massimiliano Degiorgis
GGGiorgio Gnecco
Giorgio Gnecco
SGSilvia Gorni
Silvia Gorni
Giorgio RothGiorgio Roth
Giorgio Roth
MSMarcello Sanguineti
Marcello Sanguineti
ATAngela Celeste Taramasso
Angela Celeste Taramasso

1 February 2002 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
RZR. Zoppoli
R. Zoppoli
MSM. Sanguineti
M. Sanguineti
TPT. Parisini
T. Parisini

1 January 1998 in International Journal of Control
Verified
Journal Article
Closed access
TPT. Parisini
T. Parisini
MSM. Sanguineti
M. Sanguineti
RZR. Zoppoli
R. Zoppoli
A receding-horizon (RH) optimal control scheme for a discrete-time nonlinear dynamic system is presented. A non-quadratic cost function is considered and constraints are imposed on both the state and control vectors. A stabilizing regulator is derived by adding a proper terminal penalty function to the process cost. The control vector is generated by means of a feedback control law computed off-line instead of computing it on-line, as is done for existing RH regulators. The off-line computation is performed by approximating the RH regulator by a multilayer feedforward neural network. Bounds to this approximation are established. Algorithms are presented to determine some essential parameters for the design of the neural regulator, i.e. the parameters characterizing the terminal cost function and the number of neural units in the network implementing the regulator. Simulation results show the effectiveness of the proposed approach.

1 February 2015 in Neural Computation
Verified
Journal Article
Closed access
GGGiorgio Gnecco
Giorgio Gnecco
MGMarco Gori
Marco Gori
SMStefano Melacci
Stefano Melacci
MSMarcello Sanguineti
Marcello Sanguineti
The mathematical foundations of a new theory for the design of intelligent agents are presented. The proposed learning paradigm is centered around the concept of constraint, representing the interactions with the environment, and the parsimony principle. The classical regularization framework of kernel machines is naturally extended to the case in which the agents interact with a richer environment, where abstract granules of knowledge, compactly described by different linguistic formalisms, can be translated into the unified notion of constraint for defining the hypothesis set. Constrained variational calculus is exploited to derive general representation theorems that provide a description of the optimal body of the agent (i.e., the functional structure of the optimal solution to the learning problem), which is the basis for devising new learning algorithms. We show that regardless of the kind of constraints, the optimal body of the agent is a support constraint machine (SCM) based on representer theorems that extend classical results for kernel machines and provide new representations. In a sense, the expressiveness of constraints yields a semantic-based regularization theory, which strongly restricts the hypothesis set of classical regularization. Some guidelines to unify continuous and discrete computational mechanisms are given so as to accommodate in the same framework various kinds of stimuli, for example, supervised examples and logic predicates. The proposed view of learning from constraints incorporates classical learning from examples and extends naturally to the case in which the examples are subsets of the input space, which is related to learning propositional logic clauses.

1 January 2005 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
VKVera Kůrková
Vera Kůrková
MSMarcello Sanguineti
Marcello Sanguineti
An alternative to the classical Ritz method for approximate optimization is investigated. In the extended Ritz method, sets of admissible solutions are approximated by their intersections with sets of linear combinations of all n-tuples of functions from a given basis. This alternative scheme, called variable-basis approximation, includes functions computable by trigonometric polynomials with free frequencies, free-node splines, neural networks, and other nonlinear approximating families. Estimates of rates of approximate optimization by the extended Ritz method are derived. Upper bounds on rates of convergence of suboptimal solutions to the optimal one are expressed in terms of the degree n of variable-basis functions, the modulus of continuity of the functional to be minimized, the modulus of Tikhonov well-posedness of the problem, and certain norms tailored to the type of basis. The results are applied to convex best approximation and to kernel methods in machine learning.

1 January 2020
Verified
Book
Closed access
RZRiccardo Zoppoli
Riccardo Zoppoli
MSMarcello Sanguineti
Marcello Sanguineti
GGGiorgio Gnecco
Giorgio Gnecco
TPThomas Parisini
Thomas Parisini