# Philip M. Long

According to our database

Collaborative distances:

^{1}, Philip M. Long authored at least 107 papers between 1990 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Gradient Descent with Identity Initialization Efficiently Learns Positive-Definite Linear Transformations by Deep Residual Networks.

Neural Computation, 2019

Density Estimation for Shift-Invariant Multidimensional Distributions.

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

The Singular Values of Convolutional Layers.

Proceedings of the 7th International Conference on Learning Representations, 2019

2018

Gradient descent with identity initialization efficiently learns positive definite linear transformations.

Proceedings of the 35th International Conference on Machine Learning, 2018

Learning Sums of Independent Random Variables with Sparse Collective Support.

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

How to select a winner in evolutionary optimization?

Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

Surprising properties of dropout in deep networks.

Proceedings of the 30th Conference on Learning Theory, 2017

New bounds on the price of bandit feedback for mistake-bounded online multiclass learning.

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2015

On the inductive bias of dropout.

J. Mach. Learn. Res., 2015

Special Issue on New Theoretical Challenges in Machine Learning.

Algorithmica, 2015

2014

On the Weight of Halfspaces over Hamming Balls.

SIAM J. Discrete Math., 2014

Benchmarking large-scale Fine-Grained Categorization.

Proceedings of the IEEE Winter Conference on Applications of Computer Vision, 2014

The power of localization for efficiently learning linear separators with noise.

Proceedings of the Symposium on Theory of Computing, 2014

2013

Algorithms and hardness results for parallel large margin learning.

J. Mach. Learn. Res., 2013

Low-weight halfspaces for sparse boolean vectors.

Proceedings of the Innovations in Theoretical Computer Science, 2013

Consistency versus Realizable H-Consistency for Multiclass Classification.

Proceedings of the 30th International Conference on Machine Learning, 2013

Active and passive learning of linear separators under log-concave distributions.

Proceedings of the COLT 2013, 2013

2012

Linear classifiers are nearly optimal when hidden variables have diverse effects.

Machine Learning, 2012

New Bounds for Learning Intervals with Implications for Semi-Supervised Learning.

Proceedings of the COLT 2012, 2012

2011

Algorithms and hardness results for parallel large margin learning.

Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Learning large-margin halfspaces with more malicious noise.

Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

On the Necessity of Irrelevant Variables.

Proceedings of the 28th International Conference on Machine Learning, 2011

2010

Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate.

Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering.

Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

2009

Using the doubling dimension to analyze the generalization of learning algorithms.

J. Comput. Syst. Sci., 2009

Learning Halfspaces with Malicious Noise.

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse Effect.

Proceedings of the COLT 2009, 2009

Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions.

Proceedings of the Approximation, 2009

2008

Preface.

Theor. Comput. Sci., 2008

Guest editors' introduction: Special issue on learning theory.

J. Comput. Syst. Sci., 2008

Adaptive Martingale Boosting.

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

Random classification noise defeats all convex potential boosters.

Proceedings of the Machine Learning, 2008

2007

Online Learning of Multiple Tasks with a Shared Loss.

J. Mach. Learn. Res., 2007

Discriminative learning can succeed where generative learning fails.

Inf. Process. Lett., 2007

Boosting the Area under the ROC Curve.

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

One-Pass Boosting.

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006

Attribute-efficient learning of decision lists and linear threshold functions under unconcentrated distributions.

Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Learnability and the doubling dimension.

Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Discriminative Learning Can Succeed Where Generative Learning Fails.

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Online Multitask Learning.

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

Editors' Introduction.

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

Predicting Electricity Distribution Feeder Failures Using Machine Learning Susceptibility Analysis.

Proceedings of the Proceedings, 2006

2005

Performance guarantees for hierarchical clustering.

J. Comput. Syst. Sci., 2005

Unsupervised evidence integration.

Proceedings of the Machine Learning, 2005

Martingale Boosting.

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004

Efficient algorithms for learning functions with bounded variation.

Inf. Comput., 2004

Mistake Bounds for Maximum Entropy Discrimination.

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

2003

Boosting and Microarray Data.

Machine Learning, 2003

A Theoretical Analysis of Query Selection for Collaborative Filtering.

Machine Learning, 2003

An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution.

Inf. Process. Lett., 2003

Reinforcement Learning with Immediate Rewards and Linear Hypotheses.

Algorithmica, 2003

Boosting with Diverse Base Classifiers.

Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002

Minimum Majority Classification and Boosting.

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001

The one-inclusion graph algorithm is near-optimal for the prediction model of learning.

IEEE Trans. Information Theory, 2001

Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming.

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses.

Proceedings of the Computational Learning Theory, 2001

A Theoretical Analysis of Query Selection for Collaborative Filtering.

Proceedings of the Computational Learning Theory, 2001

Agnostic Boosting.

Proceedings of the Computational Learning Theory, 2001

2000

On-Line Learning with Linear Loss Constraints.

Inf. Comput., 2000

Apple Tasting.

Inf. Comput., 2000

Approximating Hyper-Rectangles: Learning and Pseudo-random Sets

Electronic Colloquium on Computational Complexity (ECCC), 2000

Simulating Access to Hidden Information while Learning

Electronic Colloquium on Computational Complexity (ECCC), 2000

On the Complexity of Function Learning

Electronic Colloquium on Computational Complexity (ECCC), 2000

Improved bounds on the sample complexity of learning.

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On the Difficulty of Approximately Maximizing Agreements.

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

Structural Results About On-line Learning Models With and Without Queries.

Machine Learning, 1999

Dictionary Selection Using Partial Matching.

Inf. Sci., 1999

Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments.

Algorithmica, 1999

The Relaxed Online Maximum Margin Algorithm.

Proceedings of the Advances in Neural Information Processing Systems 12, [NIPS Conference, Denver, Colorado, USA, November 29, 1999

Associative Reinforcement Learning using Linear Probabilistic Concepts.

Proceedings of the Sixteenth International Conference on Machine Learning (ICML 1999), Bled, Slovenia, June 27, 1999

1998

Efficient cost measures for motion estimation at low bit rates.

IEEE Trans. Circuits Syst. Video Techn., 1998

Prediction, Learning, Uniform Convergence, and Scale-Sensitive Dimensions.

J. Comput. Syst. Sci., 1998

Approximating Hyper-Rectangles: Learning and Pseudorandom Sets.

J. Comput. Syst. Sci., 1998

On the Sample Complexity of Learning Functions with Bounded Variation.

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

The complexity of learning according to two models of a drifting environment.

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997

Guest Editor's Introduction.

Machine Learning, 1997

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets.

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Text Compression Via Alphabet Re-Representation.

Proceedings of the 7th Data Compression Conference (DCC '97), 1997

On-line Evaluation and Prediction using Linear Functions.

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996

Worst-case quadratic loss bounds for prediction using linear functions and gradient descent.

IEEE Trans. Neural Networks, 1996

Efficient Cost Measures for Motion Compensation at Low Bit Rates (Extended Abstract).

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

PAC Learning Axis-Aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples.

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

On the Complexity of Learning from Drifting Distributions.

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

Improved Bounds about On-line Learning of Smooth Functions of a Single Variable.

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995

On the sample complexity of PAC learning half-spaces against the uniform distribution.

IEEE Trans. Neural Networks, 1995

On-Line Learning of Smooth Functions of a Single Variable.

Theor. Comput. Sci., 1995

A Generalization of Sauer's Lemma.

J. Comb. Theory, Ser. A, 1995

Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions.

J. Comput. Syst. Sci., 1995

On-line Learning of Linear Functions.

Computational Complexity, 1995

Learning to Make Rent-to-Buy Decisions with Systems Applications.

Proceedings of the Machine Learning, 1995

Multiple-Dictionary Coding Using Partial Matching.

Proceedings of the IEEE Data Compression Conference, 1995

More Theorems about Scale-sensitive Dimensions and Learning.

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

Composite Geometric Concepts and Polynomial Predictability

Inf. Comput., September, 1994

Tracking Drifting Concepts By Minimizing Disagreements.

Machine Learning, 1994

Halfspace Learning, Linear Programming, and Nonmalicious Distributions.

Inf. Process. Lett., 1994

Simulating access to hidden information while learning.

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Explicit Bit Minimization for Motion-Compensated Video Coding.

Proceedings of the IEEE Data Compression Conference, 1994

Fat-Shattering and the Learnability of Real-Valued Functions.

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

On-Line Learning with Linear Loss Constraints.

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

Worst-Case Quadratic Loss Bounds for a Generalization of the Widrow-Hoff Rule.

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

On the Complexity of Function Learning.

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

Apple Tasting and Nearly One-Sided Learning

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

The Learning Complexity of Smooth Functions of a Single Variable.

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Characterizations of Learnability for Classes of {

*O, ..., n*}-Valued Functions.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

On-Line Learning of Linear Functions

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Tracking Drifting Concepts Using Random Examples.

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990

Composite Geometric Concepts and Polynomial Predictability.

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990