Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Learning Theory [[electronic resource] ] : 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings / / edited by Peter Auer, Ron Meir
| Learning Theory [[electronic resource] ] : 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings / / edited by Peter Auer, Ron Meir |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 692 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Mathematical logic Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Learning to Rank -- Ranking and Scoring Using Empirical Risk Minimization -- Learnability of Bipartite Ranking Functions -- Stability and Generalization of Bipartite Ranking Algorithms -- Loss Bounds for Online Category Ranking -- Boosting -- Margin-Based Ranking Meets Boosting in the Middle -- Martingale Boosting -- The Value of Agreement, a New Boosting Algorithm -- Unlabeled Data, Multiclass Classification -- A PAC-Style Model for Learning from Labeled and Unlabeled Data -- Generalization Error Bounds Using Unlabeled Data -- On the Consistency of Multiclass Classification Methods -- Sensitive Error Correcting Output Codes -- Online Learning I -- Data Dependent Concentration Bounds for Sequential Prediction Algorithms -- The Weak Aggregating Algorithm and Weak Mixability -- Tracking the Best of Many Experts -- Improved Second-Order Bounds for Prediction with Expert Advice -- Online Learning II -- Competitive Collaborative Learning -- Analysis of Perceptron-Based Active Learning -- A New Perspective on an Old Perceptron Algorithm -- Support Vector Machines -- Fast Rates for Support Vector Machines -- Exponential Convergence Rates in Classification -- General Polynomial Time Decomposition Algorithms -- Kernels and Embeddings -- Approximating a Gram Matrix for Improved Kernel-Based Learning -- Learning Convex Combinations of Continuously Parameterized Basic Kernels -- On the Limitations of Embedding Methods -- Leaving the Span -- Inductive Inference -- Variations on U-Shaped Learning -- Mind Change Efficient Learning -- On a Syntactic Characterization of Classification with a Mind Change Bound -- Unsupervised Learning -- Ellipsoid Approximation Using Random Vectors -- The Spectral Method for General Mixture Models -- On Spectral Learning of Mixtures of Distributions -- From Graphs to Manifolds – Weak and Strong Pointwise Consistency of Graph Laplacians -- Towards a Theoretical Foundation for Laplacian-Based Manifold Methods -- Generalization Bounds -- Permutation Tests for Classification -- Localized Upper and Lower Bounds for Some Estimation Problems -- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers -- Rank, Trace-Norm and Max-Norm -- Query Learning, Attribute Efficiency, Compression Schemes -- Learning a Hidden Hypergraph -- On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions -- Unlabeled Compression Schemes for Maximum Classes -- Economics and Game Theory -- Trading in Markovian Price Models -- From External to Internal Regret -- Separation Results for Learning Models -- Separating Models of Learning from Correlated and Uncorrelated Data -- Asymptotic Log-Loss of Prequential Maximum Likelihood Codes -- Teaching Classes with High Teaching Dimension Using Few Examples -- Open Problems -- Optimum Follow the Leader Algorithm -- The Cross Validation Problem -- Compute Inclusion Depth of a Pattern. |
| Record Nr. | UNISA-996466162403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Learning theory : 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005 : proceedings / / Peter Auer, Ron Meir (eds.)
| Learning theory : 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005 : proceedings / / Peter Auer, Ron Meir (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2005 |
| Descrizione fisica | 1 online resource (XII, 692 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) |
AuerPeter <1946 Nov. 1->
MeirRon |
| Collana | Lecture notes in computer science,Lecture notes in artificial intelligence |
| Soggetto topico |
Computational learning theory
Artificial intelligence |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Learning to Rank -- Ranking and Scoring Using Empirical Risk Minimization -- Learnability of Bipartite Ranking Functions -- Stability and Generalization of Bipartite Ranking Algorithms -- Loss Bounds for Online Category Ranking -- Boosting -- Margin-Based Ranking Meets Boosting in the Middle -- Martingale Boosting -- The Value of Agreement, a New Boosting Algorithm -- Unlabeled Data, Multiclass Classification -- A PAC-Style Model for Learning from Labeled and Unlabeled Data -- Generalization Error Bounds Using Unlabeled Data -- On the Consistency of Multiclass Classification Methods -- Sensitive Error Correcting Output Codes -- Online Learning I -- Data Dependent Concentration Bounds for Sequential Prediction Algorithms -- The Weak Aggregating Algorithm and Weak Mixability -- Tracking the Best of Many Experts -- Improved Second-Order Bounds for Prediction with Expert Advice -- Online Learning II -- Competitive Collaborative Learning -- Analysis of Perceptron-Based Active Learning -- A New Perspective on an Old Perceptron Algorithm -- Support Vector Machines -- Fast Rates for Support Vector Machines -- Exponential Convergence Rates in Classification -- General Polynomial Time Decomposition Algorithms -- Kernels and Embeddings -- Approximating a Gram Matrix for Improved Kernel-Based Learning -- Learning Convex Combinations of Continuously Parameterized Basic Kernels -- On the Limitations of Embedding Methods -- Leaving the Span -- Inductive Inference -- Variations on U-Shaped Learning -- Mind Change Efficient Learning -- On a Syntactic Characterization of Classification with a Mind Change Bound -- Unsupervised Learning -- Ellipsoid Approximation Using Random Vectors -- The Spectral Method for General Mixture Models -- On Spectral Learning of Mixtures of Distributions -- From Graphs to Manifolds – Weak and Strong Pointwise Consistency of Graph Laplacians -- Towards a Theoretical Foundation for Laplacian-Based Manifold Methods -- Generalization Bounds -- Permutation Tests for Classification -- Localized Upper and Lower Bounds for Some Estimation Problems -- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers -- Rank, Trace-Norm and Max-Norm -- Query Learning, Attribute Efficiency, Compression Schemes -- Learning a Hidden Hypergraph -- On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions -- Unlabeled Compression Schemes for Maximum Classes -- Economics and Game Theory -- Trading in Markovian Price Models -- From External to Internal Regret -- Separation Results for Learning Models -- Separating Models of Learning from Correlated and Uncorrelated Data -- Asymptotic Log-Loss of Prequential Maximum Likelihood Codes -- Teaching Classes with High Teaching Dimension Using Few Examples -- Open Problems -- Optimum Follow the Leader Algorithm -- The Cross Validation Problem -- Compute Inclusion Depth of a Pattern. |
| Altri titoli varianti |
18th Annual Conference on Learning Theory
Eighteenth Annual Conference on Learning Theory Conference on Learning Theory COLT 2005 |
| Record Nr. | UNINA-9910484780803321 |
| Berlin ; ; New York, : Springer, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||