Sciweavers

81 search results - page 7 / 17
» On the Foundations of Universal Sequence Prediction
Sort
View
COLT
2010
Springer
14 years 9 months ago
Following the Flattened Leader
We analyze the regret, measured in terms of log loss, of the maximum likelihood (ML) sequential prediction strategy. This "follow the leader" strategy also defines one o...
Wojciech Kotlowski, Peter Grünwald, Steven de...
FOCS
1989
IEEE
15 years 3 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
COLT
2006
Springer
15 years 3 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
BMCBI
2008
147views more  BMCBI 2008»
14 years 11 months ago
Transmembrane helix prediction using amino acid property features and latent semantic analysis
Background: Prediction of transmembrane (TM) helices by statistical methods suffers from lack of sufficient training data. Current best methods use hundreds or even thousands of f...
Madhavi Ganapathiraju, Narayanas Balakrishnan, Raj...
BMCBI
2007
157views more  BMCBI 2007»
14 years 11 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...