TIT 2002 - PDF Preprint Papers

TIT 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TIT-2002 Paper

click to vote

TIT
2002

164views more TIT 2002»

On the generalization of soft margin algorithms

13 years 4 months ago

Download eprints.ucl.ac.uk

Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...

John Shawe-Taylor, Nello Cristianini

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	164	On the generalization of soft margin algorithms	claim
2	148	The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks	claim
3	146	Bounds on the performance of belief propagation decoding	claim
4	146	Least squares estimation of 2-D sinusoids in colored noise: Asymptotic analysis	claim
5	142	A random matrix model of communication via antenna arrays	claim
6	129	Combinatorial bounds for list decoding	claim
7	129	Arbitrary source models and Bayesian codebooks in rate-distortion theory	claim
8	129	Asymptotic statistical properties of AR Spectral estimators for processes with mixed spectra	claim
9	128	Bandwidth scaling for fading multipath channels	claim
10	126	Two-dimensional interleaving schemes with repetitions: Constructions and bounds	claim
11	125	Optimal bi-level quantization of i.i.d. sensor observations for binary hypothesis testing	claim
12	121	Asymptotic normality of linear multiuser receiver outputs	claim
13	120	Finite-length analysis of low-density parity-check codes on the binary erasure channel	claim
14	118	Cayley differential unitary space - Time codes	claim
15	116	On delayed prediction of individual sequences	claim
16	108	Bounds on packings of spheres in the Grassmann manifold	claim
17	107	Wavelet deconvolution	claim
18	107	Constrained systems with unconstrained positions	claim
19	103	Optimization of coded GMSK systems	claim
20	102	Asymptotic efficiency of two-stage disjunctive testing	claim
21	101	Spectrally efficient noncoherent communication	claim
22	101	Large-system performance analysis of blind and group-blind multiuser receivers	claim
23	99	Poisson intensity estimation for tomographic data using a wavelet shrinkage approach	claim
24	99	Capacity scaling in MIMO Wireless systems under correlated fading	claim
25	99	Feedback strategies for white Gaussian interference networks	claim
26	98	DC-free binary convolutional coding	claim
27	97	On a relation between information inequalities and group theory	claim
28	96	Wavelet-based estimators of scaling behavior	claim
29	96	An axiomatization of partition entropy	claim
30	95	On sequential strategies for loss functions with memory	claim
31	95	Mutual information approach to blind separation of stationary sources	claim
32	95	Opportunistic beamforming using dumb antennas	claim
33	94	A generalized uncertainty principle and sparse representation in pairs of bases	claim
34	92	Asymmetric multiple description lattice vector quantizers	claim
35	91	Hidden Markov processes	claim
36	91	On limited-delay lossy coding and filtering of individual sequences	claim
37	90	Optimal sequences for CDMA under colored noise: A Schur-saddle function property	claim
38	89	Upper bounds on the rate of LDPC Codes	claim
39	89	Comparison of worst case errors in linear and neural network approximation	claim
40	89	Universal linear least squares prediction: Upper and lower bounds	claim
41	88	Duality between channel capacity and rate distortion with two-sided state information	claim
42	87	Coding theorems for turbo code ensembles	claim
43	86	A low-rate bound on the reliability of a quantum discrete memoryless channel	claim
44	86	Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates	claim
45	85	Parallel constrained coding with application to two-dimensional constraints	claim
46	83	Capacity and reliability function for small peak signal constraints	claim
47	83	On binary 1-perfect additive codes: Some structural properties	claim
48	82	Order estimation for a special class of hidden Markov sources and binary renewal processes	claim
49	81	On sampling in shift invariant spaces	claim
50	81	Multicast topology inference from measured end-to-end loss	claim
51	81	The decimation-Hadamard transform of two-level autocorrelation sequences	claim
52	81	New nonbinary sequences with ideal two-level autocorrelation	claim
53	78	Optimal placement of training for frequency-selective block-fading channels	claim
54	78	Gaussian source coding with spherical codes	claim
55	78	Improved upper bounds on sizes of codes	claim
56	78	Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding	claim
57	78	Communicating via a processing broadcast satellite	claim
58	77	Capacity-achieving sequences for the erasure channel	claim
59	76	Error exponents of expander codes	claim
60	75	Iterative multiuser joint decoding: Unified framework and asymptotic analysis	claim
61	75	Analytic variations on redundancy rates of renewal processes	claim
62	73	Quantum rate-distortion theory for memoryless sources	claim
63	73	The minimum distance of the duals of binary irreducible cyclic codes	claim
64	73	Power levels and packet lengths in random multiple access	claim
65	72	Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem	claim
66	72	Convergence of stochastic-approximation-based algorithms for blind channel identification	claim
67	72	Optimal tight frames and quantum measurement	claim
68	72	Universal codes for finite sequences of integers drawn from a monotone distribution	claim
69	72	Principal curves with bounded turn	claim
70	70	High-rate codes that are linear in space and time	claim
71	69	On the second derivative of a Gaussian process envelope	claim
72	69	Filter bank frame expansions with erasures	claim
73	69	Broad-band fading channels: Signal burstiness and capacity	claim
74	68	A Lagrangian formulation of Zador's entropy-constrained quantization theorem	claim
75	67	Closest point search in lattices	claim
76	67	Some new results for optimal ternary linear codes	claim
77	67	Capacity of multiple-transmit multiple-receive antenna architectures	claim
78	67	A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors	claim
79	66	A note on robust hypothesis testing	claim
80	65	On the importance of combining wavelet-based nonlinear approximation with coding strategies	claim
81	65	Existence and construction of noncoherent unitary space-time codes	claim
82	64	An information-theoretic and game-theoretic study of timing channels	claim
83	64	Performance of blind and group-blind multiuser detectors	claim
84	64	Exact pairwise error probability of space-time codes	claim
85	63	A construction of a space-time code based on number theory	claim
86	63	Fibonacci and Galois representations of feedback-with-carry shift registers	claim
87	63	Structured unitary space-time autocoding constellations	claim
88	63	Compressing quantum mixed-state sources by sending classical information	claim
89	62	Random codes: Minimum distances and error exponents	claim
90	62	Maximum-likelihood binary shift-register synthesis from noisy observations	claim
91	62	Design and performance of VQ-based hybrid digital-analog joint source-channel codes	claim
92	60	Parallel error correcting codes	claim
93	60	A Zador-like formula for quantizers based on periodic tilings	claim
94	60	Spectral efficiency in the wideband regime	claim
95	58	On the asymptotic eigenvalue distribution of concatenated vector-valued fading channels	claim
96	58	Analysis of a complexity-based pruning scheme for classification trees	claim
97	58	Multiuser capacity in block fading with no channel state information	claim
98	57	Multiple description vector quantization with a coarse lattice	claim
99	57	Information-theoretic inequalities for contoured probability distributions	claim
100	57	Variance of the turbo code performance bound over the interleavers	claim
101	57	Writing sequences on the plane	claim
102	56	Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes	claim
103	55	On the equivalence of three reduced rank linear estimators with applications to DS-CDMA	claim
104	54	Theory of paraunitary filter banks over fields of characteristic two	claim
105	54	Joint message-passing decoding of LDPC Codes and partial-response channels	claim
106	54	The q-ary image of some qm-ary cyclic codes: Permutation group and soft-decision decoding	claim
107	54	Quasi-cyclic dyadic codes in the Walsh--Hadamard transform domain	claim
108	53	Maximum entropy versus minimum risk and applications to some classical discrete distributions	claim
109	50	A rank criterion for QAM space-time codes	claim
110	47	A model for stock price fluctuations based on information	claim
111	47	The throughput of some wireless multiaccess systems	claim
112	46	The Gaussian watermarking game	claim
113	45	MMSE detection in asynchronous CDMA systems: an equivalence result	claim
114	44	Source coding, large deviations, and approximate pattern matching	claim
115	44	On the structure of optimal entropy-constrained scalar quantizers	claim
116	37	Square-matrix embeddable space-time block codes for complex signal constellations	claim
117	35	Gilbert-Varshamov bound for Euclidean space codes over distance-uniform signal sets	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers