On the public citation graph
On-line learning of linear functions
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1009openalex-snapshot
The Weighted Majority Algorithm
inferredcites →https://doi.org/10.1007/bf00114802openalex-snapshot
Learning Conjunctive Concepts in Structural Domains
inferredcites →https://doi.org/10.1007/bfb0101073openalex-snapshot
Hadamard Matrices and Their Applications
inferredcites →https://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50018-3openalex-snapshot
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1090/s0002-9939-1988-0943082-5openalex-snapshot
A Learning Theorem for Linear Operators
inferredcites →https://doi.org/10.1109/tit.1967.1053968openalex-snapshot
A lower bound for discrimination information in terms of variation (Corresp.)
inferredcites →https://doi.org/10.1145/130385.130403openalex-snapshot
Absolute error bounds for learning linear functions online
inferredcites →https://doi.org/10.1145/168304.168390openalex-snapshot
Worst-case quadratic loss bounds for a generalization of the Widrow-Hoff rule
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.5555/114836.114851openalex-snapshot
Learning in the presence of finitely or infinitely many irrelevant attributes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1996.2612openalex-snapshot
Exponentiated Gradient versus Gradient Descent for Linear Predictors
inferred← citeshttps://doi.org/10.1006/jcss.1997.1556openalex-snapshot
A Game of Prediction with Expert Advice
inferred← citeshttps://doi.org/10.1006/jcss.1999.1635openalex-snapshot
Analysis of Two Gradient-Based Algorithms for On-Line Regression
inferred← citeshttps://doi.org/10.1006/jcss.2001.1795openalex-snapshot
Adaptive and Self-Confident On-Line Learning Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-36434-x_4openalex-snapshot
An Introduction to Boosting and Leveraging
inferred← citeshttps://doi.org/10.1007/3-540-45579-5_9openalex-snapshot
Chess Neighborhoods, Function Combination, and Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_52openalex-snapshot
Probability theory for the Brier game
inferred← citeshttps://doi.org/10.1007/bf00115301openalex-snapshot
On-line Prediction and Conversion Strategies
inferred← citeshttps://doi.org/10.1016/j.ifacol.2023.10.1294openalex-snapshot
Adaptive Decision-Making with Constraints and Dependent Losses: Performance Guarantees and Applications to Online and Nonlinear Identification
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00039-8openalex-snapshot
The perceptron algorithm versus winnow: linear versus logarithmic mistake bounds when few input variables are relevant
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00133-xopenalex-snapshot
Probability theory for the Brier game
inferred← citeshttps://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferred← citeshttps://doi.org/10.1023/a:1010896012157openalex-snapshot
Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions
inferred← citeshttps://doi.org/10.1023/a:1013912006537openalex-snapshot
Logistic Regression, AdaBoost and Bregman Distances
inferred← citeshttps://doi.org/10.1109/18.705569openalex-snapshot
Sequential prediction of individual sequences under general loss functions
inferred← citeshttps://doi.org/10.1145/225298.225304openalex-snapshot
A game of prediction with expert advice
inferred← citeshttps://doi.org/10.1145/267460.267471openalex-snapshot
On-line evaluation and prediction using linear functions
inferred← citeshttps://doi.org/10.1145/267460.267492openalex-snapshot
Analysis of two gradient-based algorithms for on-line regression
inferred← citeshttps://doi.org/10.1184/r1/6475592openalex-snapshot
Efficient Representations for Life-Long Learning and Autoencoding
inferred← citeshttps://doi.org/10.48550/arxiv.0806.4686openalex-snapshot
Sparse Online Learning via Truncated Gradient
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0040openalex-snapshot
Expectation-maximization for logistic regression
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0302039openalex-snapshot
Kalman-filtering using local interactions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.