Conferences in DBLP
Hans-Ulrich Simon How Many Queries Are Needed to Learn One Bit of Information? [Citation Graph (0, 0)][DBLP ] Conf ] Michael Schmitt Radial Basis Function Neural Networks Have Superlinear VC Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Bousquet , Manfred K. Warmuth Tracking a Small Set of Experts by Mixing Past Posteriors. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolò Cesa-Bianchi , Gábor Lugosi Potential-Based Algorithms in Online Prediction and Game Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Tong Zhang A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak Chawla , Lin Li , Stephen Scott Efficiently Approximating Weighted Sums with Exponentially Many Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Koby Crammer , Yoram Singer Ultraconservative Online Algorithms for Multiclass Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Paul W. Goldberg Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required. [Citation Graph (0, 0)][DBLP ] Conf ] Shie Mannor , Nahum Shimkin Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments. [Citation Graph (0, 0)][DBLP ] Conf ] John Case , Sanjay Jain , Frank Stephan , Rolf Wiehagen Robust Learning - Rich and Poor. [Citation Graph (0, 0)][DBLP ] Conf ] Sandra Zilles On the Synthesis of Strategies Identifying Recursive Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjay Jain , Efim B. Kinber Intrinsic Complexity of Learning Geometrical Concepts from Positive Data. [Citation Graph (0, 0)][DBLP ] Conf ] David G. Stork Toward a Computational Theory of Data Acquisition and Truthing. [Citation Graph (0, 0)][DBLP ] Conf ] Antonio Piccolboni , Christian Schindelhauer Discrete Prediction Games with Arbitrary Feedback and Loss. [Citation Graph (0, 0)][DBLP ] Conf ] Peter L. Bartlett , Shahar Mendelson Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Koltchinskii , Dmitriy Panchenko , Fernando Lozano Further Explanation of the Effectiveness of Voting Methods: The Game between Margins and Weights. [Citation Graph (0, 0)][DBLP ] Conf ] Shahar Mendelson Geometric Methods in the Analysis of Glivenko-Cantelli Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Shahar Mendelson Learning Relatively Small Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Philip M. Long On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses. [Citation Graph (0, 0)][DBLP ] Conf ] Paul W. Goldberg When Can Two Unsupervised Learners Achieve PAC Separation? [Citation Graph (0, 0)][DBLP ] Conf ] Peter Grünwald Strong Entropy Concentration, Game Theory, and Algorithmic Randomness. [Citation Graph (0, 0)][DBLP ] Conf ] Ilia Nouretdinov , Volodya Vovk , Michael V. Vyugin , Alexander Gammerman Pattern Recognition and Density Estimation under the General i.i.d. Assumption. [Citation Graph (0, 0)][DBLP ] Conf ] José L. Balcázar , Jorge Castro , David Guijarro A General Dimension for Exact Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Balázs Kégl , Tamás Linder , Gábor Lugosi Data-Dependent Margin-Based Generalization Bounds for Classification. [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David , Nadav Eiron , Hans-Ulrich Simon Limitations of Learning via Embeddings in Euclidean Half-Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Forster , Niels Schmitt , Hans-Ulrich Simon Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Schölkopf , Ralf Herbrich , Alex J. Smola A Generalized Representer Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Tong Zhang A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Herbster Learning Additive Models Online with Fast Evaluating Kernels. [Citation Graph (0, 0)][DBLP ] Conf ] Shie Mannor , Ron Meir Geometric Bounds for Generalization in Boosting. [Citation Graph (0, 0)][DBLP ] Conf ] Rocco A. Servedio Smooth Boosting and Learning with Malicious Noise. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Dmitry Gavinsky On Boosting with Optimal Poly-Bounded Distributions. [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David , Philip M. Long , Yishay Mansour Agnostic Boosting. [Citation Graph (0, 0)][DBLP ] Conf ] Wee Sun Lee , Philip M. Long A Theoretical Analysis of Query Selection for Collaborative Filtering. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Vitaly Feldman On Using Extended Statistical Queries to Avoid Membership Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Nadav Eiron Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Rocco A. Servedio On Learning Monotone DNF under Product Distributions. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Avi Owshanko Learning Regular Sets with an Incomplete Membership Oracle. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Even-Dar , Yishay Mansour Learning Rates for Q-Learning. [Citation Graph (0, 0)][DBLP ] Conf ] Sham Kakade Optimizing Average Reward Using Discounted Rewards. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Peshkin , Sayan Mukherjee Bounds on Sample Size for Policy Evaluation in Markov Environments. [Citation Graph (0, 0)][DBLP ] Conf ] 