Sciweavers

683 search results - page 84 / 137
» Generalization Bounds for Learning Kernels
Sort
View
CCR
2010
156views more  CCR 2010»
13 years 10 months ago
Evolvable network architectures: what can we learn from biology?
There is significant research interest recently to understand the evolution of the current Internet, as well as to design clean-slate Future Internet architectures. Clearly, even ...
Constantine Dovrolis, J. Todd Streelman
JMLR
2010
121views more  JMLR 2010»
13 years 4 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
JMLR
2010
159views more  JMLR 2010»
13 years 4 months ago
Semi-Supervised Learning with Max-Margin Graph Cuts
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
Branislav Kveton, Michal Valko, Ali Rahimi, Ling H...
IJON
2008
133views more  IJON 2008»
13 years 8 months ago
A multi-objective approach to RBF network learning
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
Illya Kokshenev, Antônio de Pádua Bra...
COMBINATORICA
2010
13 years 4 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...