This paper presents an application of learning algorithms to the prediction of HIV-1 phenotypic drug resistance from genotype. The objective of this research consists of two main subjects. The first part is to apply t...
详细信息
ISBN:
(纸本)9781424441334
This paper presents an application of learning algorithms to the prediction of HIV-1 phenotypic drug resistance from genotype. The objective of this research consists of two main subjects. The first part is to apply the Support Vector Machine (SVM), the Radial Basis Function Network (the RBF network), and k-Nearest Neighbor (k-NN) to predicting HIV-1 drug resistance. The second part is to study the behavior of each learning algorithms and compare the predictive performance. The results indicate that SVM yields the highest accuracy. The RBF network gives the highest sensitivity whereas k-NN yields the best in specificity.
The problem of objective evaluation of learning algorithms is analyzed under the principles of coherence and covariance. The theory of Bayesian information geometry satisfies these principles and encompasses most of t...
详细信息
ISBN:
(纸本)0780341236
The problem of objective evaluation of learning algorithms is analyzed under the principles of coherence and covariance. The theory of Bayesian information geometry satisfies these principles and encompasses most of the commonly used learning criteria. Implications to learning theory are discussed.
Cluster-sparse channels often exist in frequency-selective fading broadband communication systems. The main reason is received scattered waveform exhibits cluster structure which is caused by a few reflectors near the...
详细信息
ISBN:
(纸本)9789860334074
Cluster-sparse channels often exist in frequency-selective fading broadband communication systems. The main reason is received scattered waveform exhibits cluster structure which is caused by a few reflectors near the receiver. Conventional sparse channel estimation methods have been proposed for general sparse channel model which without considering the potential cluster-sparse structure information. In this paper, we investigate the cluster-sparse channel estimation (CS-CE) problems in the state of the art orthogonal frequency-division multiplexing (OFDM) systems. Novel Bayesian cluster-sparse channel estimation (BCS-CE) methods are proposed to exploit the cluster-sparse structure by using block sparse Bayesian learning (BSBL) algorithm. The proposed methods take advantage of the cluster correlation in training matrix so that they can improve estimation performance. In addition, different from our previous method using uniform block partition information, the proposed methods can work well when the prior block partition information of channels is unknown. Computer simulations show that the proposed method has a superior performance when compared with the previous methods.
One of the core aspects of human-human interaction is the ability to recognize and respond to the emotional and cognitive states of the other person, leaving human-computer interaction systems, at their core, to perfo...
详细信息
ISBN:
(纸本)9783319586281;9783319586274
One of the core aspects of human-human interaction is the ability to recognize and respond to the emotional and cognitive states of the other person, leaving human-computer interaction systems, at their core, to perform many of the same tasks.
Neural networks (NNs) struggle to efficiently solve certain problems, such as learning parities, even when there are simple learning algorithms for those problems. Can NNs discover learning algorithms on their own? We...
详细信息
ISBN:
(纸本)9781713871088
Neural networks (NNs) struggle to efficiently solve certain problems, such as learning parities, even when there are simple learning algorithms for those problems. Can NNs discover learning algorithms on their own? We exhibit a NN architecture that, in polynomial time, learns as well as any efficient learning algorithm describable by a constant-sized program. For example, on parity problems, the NN learns as well as Gaussian elimination, an efficient algorithm that can be succinctly described. Our architecture combines both recurrent weight sharing between layers and convolutional weight sharing to reduce the number of parameters down to a constant, even though the network itself may have trillions of nodes. While in practice the constants in our analysis are too large to be directly meaningful, our work suggests that the synergy of Recurrent and Convolutional NNs (RCNNs) may be more natural and powerful than either alone, particularly for concisely parameterizing discrete algorithms.
A Wireless Sensor Network (WSN) is composed of sensor equipped devices that aim at sensing and processing information from the surrounding environment. Energy consumption is the major concern of WSNs. At the same time...
详细信息
ISBN:
(纸本)9789812879905;9789812879899
A Wireless Sensor Network (WSN) is composed of sensor equipped devices that aim at sensing and processing information from the surrounding environment. Energy consumption is the major concern of WSNs. At the same time, quality of service is to be considered especially when dealing with critical WSNs. In this paper, we present a game theory based approach to maximize quality of service, defined as the aggregate frame success rate, while optimizing power allocation. Game theory is designed to study interactions between players (e.g. chess players) who decide on a set of actions (e.g. the players moves) to reach the objective outcomes (e.g. to win the game). Here, we model the system as a potential game. We show that the optimal power allocation, crucial in a heterogeneous sensor network, is a Nash equilibrium of this game, and we discuss its uniqueness. For simulations, we present a fully distributed algorithm that drives the whole system to the optimal power allocation.
Estimating heterogeneous treatment effects (HTE) from observational studies is rising in importance due to the widespread accumulation of data in many fields. Due to the selection bias behind the inaccessibility of co...
详细信息
Estimating heterogeneous treatment effects (HTE) from observational studies is rising in importance due to the widespread accumulation of data in many fields. Due to the selection bias behind the inaccessibility of counterfactual data, the problem differs fundamentally from supervised learning in a challenging way. However, existing works on modeling selection bias and corresponding algorithms do not naturally generalize to non-binary treatment spaces. To address this limitation, we propose to use mutual information to describe selection bias in estimating HTE and derive a novel error bound using the mutual information between the covariates and the treatments, which is the first error bound to cover general treatment schemes including multinoulli or continuous spaces. We then bring forth theoretically justified algorithms, the Mutual Information Treatment Network (MitNet), using adversarial optimization to reduce selection bias and obtain more accurate HTE estimations. Our algorithm reaches remarkable performance in both simulation study and empirical evaluation.
The support/query episodic training strategy has been widely applied in modern meta learning algorithms. Supposing the n training episodes and the test episodes are sampled independently from the same environment, pre...
详细信息
ISBN:
(纸本)9781713871088
The support/query episodic training strategy has been widely applied in modern meta learning algorithms. Supposing the n training episodes and the test episodes are sampled independently from the same environment, previous work has derived a generalization bound of O(1/root n) for smooth non-convex functions via algorithmic stability analysis. In this paper, we provide fine-grained analysis of stability and generalization for modern meta learning algorithms by considering more general situations. Firstly, we develop matching lower and upper stability bounds for meta learning algorithms with two types of loss functions: (1) nonsmooth convex functions with alpha-Holder continuous subgradients (alpha is an element of[0, 1));(2) smooth (including convex and non-convex) functions. Our tight stability bounds show that, in the nonsmooth convex case, meta learning algorithms can be inherently less stable than in the smooth convex case. For the smooth non-convex functions, our stability bound is sharper than the existing one, especially in the setting where the number of iterations is larger than the number n of training episodes. Secondly, we derive improved generalization bounds for meta learning algorithms that hold with high probability. Specifically, we first demonstrate that, under the independent episode environment assumption, the generalization bound of O(1/root n) via algorithmic stability analysis is near optimal. To attain faster convergence rate, we show how to yield a deformed generalization bound of O(ln n/n) with the curvature condition of loss functions. Finally, we obtain a generalization bound for meta learning with dependent episodes whose dependency relation is characterized by a graph. Experiments on regression problems are conducted to verify our theoretical results.
A class of unsupervised algorithms known as competitive learning (CL) was investigated for its application as an adaptive control mechanism for an educational toy. Two variants of CL were used, hard competitive learni...
详细信息
ISBN:
(纸本)0852966903
A class of unsupervised algorithms known as competitive learning (CL) was investigated for its application as an adaptive control mechanism for an educational toy. Two variants of CL were used, hard competitive learning (HCL) and soft competitive learning (SCL). It was clearly shown that CL was suitable for the unsupervised clustering needed in an autonomous robotic toy. SCL was found to out-perform HCL in the more challenging test cases examined. Furthermore, simulations indicated that radial basis functions may be used within the constraints of the hardware system if the exponential function was replaced with a lookup table equivalent of a least 15 elements.
This paper studies kernel regression problems. The focus is on studying kernel algorithms that use the least squares criterion and developing methods so that the solution in the dual observation space intelligently ch...
详细信息
ISBN:
(纸本)0780383591
This paper studies kernel regression problems. The focus is on studying kernel algorithms that use the least squares criterion and developing methods so that the solution in the dual observation space intelligently chooses training examples. The Least Squares - Support Vector Machine (LS-SVM) and variants have attracted researchers as the solution to nonlinear problems can be formulated as an optimization problem that involves finding a solution to a set of linear equations in the primal or dual spaces. A drawback of using the LS-SVM is that the solution is not sparse, but involves a solution to a set of linear equations in the dual space that is dependent on the number of observations. This paper discusses an on-line algorithm that selectively chooses to add and delete training observations. Through examples we show that this algorithm can outperform LS-SVM solutions that use a larger window of randomly trained examples.
暂无评论