[PDF][PDF] Some greedy learning algorithms for sparse regression and classification with mercer kernels
PB Nair, A Choudhury, AJ Keane - Journal of Machine Learning Research, 2002 - jmlr.org
We present some greedy learning algorithms for building sparse nonlinear regression and
classification models from observational data using Mercer kernels. Our objective is to …
classification models from observational data using Mercer kernels. Our objective is to …
On Minimality of Initial Data Required to Uniquely Characterize Every Trajectory in a Discrete -D System
In this paper, we provide an essentially complete answer to the question of minimal initial
data required to solve an overdetermined system of linear partial difference equations with …
data required to solve an overdetermined system of linear partial difference equations with …
Lyapunov stability of 2D finite-dimensional behaviours
In this article we investigate a Lyapunov approach to the stability of finite-dimensional 2D
systems. We use the behavioural framework and consider a notion of stability following the …
systems. We use the behavioural framework and consider a notion of stability following the …
Every discrete 2D autonomous system admits a finite union of parallel lines as a characteristic set
D Pal - Multidimensional Systems and Signal Processing, 2017 - Springer
In this paper, we show that every discrete 2D autonomous system, that is described by a set
of linear partial difference equations with constant real coefficients, admits a finite union of …
of linear partial difference equations with constant real coefficients, admits a finite union of …
State representations of convolutional codes over a finite ring
In this paper we study finite support convolutional codes over Z pr by means of an input-state-
output representation. We show that the set of finite weight input-state-output trajectories …
output representation. We show that the set of finite weight input-state-output trajectories …
Feasible initial conditions for 2D discrete state-space systems
The aim of this contribution is to characterize the set of feasible initial conditions on a
diagonal line in order to compute the solutions of a 2D discrete state-space system (defined …
diagonal line in order to compute the solutions of a 2D discrete state-space system (defined …
The generic degree of autonomy
S Shankar, P Rocha - SIAM Journal on Applied Algebra and Geometry, 2018 - SIAM
This paper calculates the degree of autonomy of a generic autonomous nD system defined
by the kernel of a partial difference operator. The calculation implies that attaching a generic …
by the kernel of a partial difference operator. The calculation implies that attaching a generic …
Algorithms for verification of characteristic sets of discrete autonomous nD systems with n≥ 2
An important question for multidimensional systems is to characterize the minimum
information required to uniquely specify a 'trajectory'. For a discrete nD system described by …
information required to uniquely specify a 'trajectory'. For a discrete nD system described by …
On restrictions of n-d systems to 1-d subspaces
In this paper, we look into restrictions of the solution set of a system of PDEs to 1-d
subspaces. We bring out its relation with certain intersection modules. We show that the …
subspaces. We bring out its relation with certain intersection modules. We show that the …
On Arbitrary Assignability of Initial Conditions for a Discrete Autonomous -D System
The issue of initial/boundary conditions for a general system of partial difference equations
(PDEs)—called a discrete-D system—is resolved through the notion of characteristic sets …
(PDEs)—called a discrete-D system—is resolved through the notion of characteristic sets …