210 resultados para Bartlett
Resumo:
Abstract Alcohol dependence is a disease that impacts millions of individuals worldwide. There has been some progress with pharmacotherapy for alcohol-dependent individuals; however, there remains a critical need for the development of novel and additional therapeutic approaches. Alcohol and nicotine are commonly abused together, and there is evidence that neuronal nicotinic acetylcholine receptors (nAChRs) play a role in both alcohol and nicotine dependence. Varenicline, a partial agonist at the alpha4beta2 nAChRs, reduces nicotine intake and was recently approved as a smoking cessation aid. We have investigated the role of varenicline in the modulation of ethanol consumption and seeking using three different animal models of drinking. We show that acute administration of varenicline, in doses reported to reduce nicotine reward, selectively reduced ethanol but not sucrose seeking using an operant self-administration drinking paradigm and also decreased voluntary ethanol but not water consumption in animals chronically exposed to ethanol for 2 months before varenicline treatment. Furthermore, chronic varenicline administration decreased ethanol consumption, which did not result in a rebound increase in ethanol intake when the varenicline was no longer administered. The data suggest that the alpha4beta2 nAChRs may play a role in ethanol-seeking behaviors in animals chronically exposed to ethanol. The selectivity of varenicline in decreasing ethanol consumption combined with its reported safety profile and mild side effects in humans suggest that varenicline may prove to be a treatment for alcohol dependence.
Resumo:
Abstract RATIONALE: Previous studies have shown that orexin-1/hypocretin-1 receptors play a role in self-administration and cue-induced reinstatement of food, drug, and ethanol seeking. In the current study, we examined the role of orexin-1/hypocretin-1 receptors in operant self-administration of ethanol and sucrose and in yohimbine-induced reinstatement of ethanol and sucrose seeking. MATERIALS AND METHODS: Rats were trained to self-administer either 10% ethanol or 5% sucrose (30 min/day). The orexin-1 receptor antagonist SB334867 (0, 5, 10, 15, 20 mg/kg, i.p.) was administered 30 min before the operant self-administration sessions. After these experiments, the operant self-administration behaviors were extinguished in both the ethanol and sucrose-trained rats. Upon reaching extinction criteria, SB334867 (0, 5, 10 mg/kg, i.p.) was administered 30 min before yohimbine (0 or 2 mg/kg, i.p.). In a separate experiment, the effect of SB334867 (0, 15, or 20 mg/kg, i.p.) on general locomotor activity was determined using the open-field test. RESULTS: The orexin-1 receptor antagonist, SB334867 (10, 15 and 20 mg/kg) decreased operant self-administration of 10% ethanol but not 5% sucrose self-administration. Furthermore, SB334867 (5 and 10 mg/kg) significantly decreased yohimbine-induced reinstatement of both ethanol and sucrose seeking. SB334867 did not significantly affect locomotor activity measured using the open-field test. CONCLUSIONS: The results suggest that inhibition of OX-1/Hcrt-1 receptors modulates operant ethanol self-administration and also plays a significant role in yohimbine-induced reinstatement of both ethanol and sucrose seeking in rats.
Resumo:
A classical condition for fast learning rates is the margin condition, first introduced by Mammen and Tsybakov. We tackle in this paper the problem of adaptivity to this condition in the context of model selection, in a general learning framework. Actually, we consider a weaker version of this condition that allows one to take into account that learning within a small model can be much easier than within a large one. Requiring this “strong margin adaptivity” makes the model selection problem more challenging. We first prove, in a general framework, that some penalization procedures (including local Rademacher complexities) exhibit this adaptivity when the models are nested. Contrary to previous results, this holds with penalties that only depend on the data. Our second main result is that strong margin adaptivity is not always possible when the models are not nested: for every model selection procedure (even a randomized one), there is a problem for which it does not demonstrate strong margin adaptivity.
Resumo:
In the multi-view approach to semisupervised learning, we choose one predictor from each of multiple hypothesis classes, and we co-regularize our choices by penalizing disagreement among the predictors on the unlabeled data. We examine the co-regularization method used in the co-regularized least squares (CoRLS) algorithm, in which the views are reproducing kernel Hilbert spaces (RKHS's), and the disagreement penalty is the average squared difference in predictions. The final predictor is the pointwise average of the predictors from each view. We call the set of predictors that can result from this procedure the co-regularized hypothesis class. Our main result is a tight bound on the Rademacher complexity of the co-regularized hypothesis class in terms of the kernel matrices of each RKHS. We find that the co-regularization reduces the Rademacher complexity by an amount that depends on the distance between the two views, as measured by a data dependent metric. We then use standard techniques to bound the gap between training error and test error for the CoRLS algorithm. Experimentally, we find that the amount of reduction in complexity introduced by co regularization correlates with the amount of improvement that co-regularization gives in the CoRLS algorithm.
Resumo:
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). OLP uses its experience so far to estimate the MDP. It chooses actions by optimistically maximizing estimated future rewards over a set of next-state transition probabilities that are close to the estimates, a computation that corresponds to solving linear programs. We show that the total expected reward obtained by OLP up to time T is within C(P) log T of the reward obtained by the optimal policy, where C(P) is an explicit, MDP-dependent constant. OLP is closely related to an algorithm proposed by Burnetas and Katehakis with four key differences: OLP is simpler, it does not require knowledge of the supports of transition probabilities, the proof of the regret bound is simpler, but our regret bound is a constant factor larger than the regret of their algorithm. OLP is also similar in flavor to an algorithm recently proposed by Auer and Ortner. But OLP is simpler and its regret bound has a better dependence on the size of the MDP.
Resumo:
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ∗ ( √ T) against an adaptive adversary. This improves on the previous algorithm [8] whose regret is bounded in expectation against an oblivious adversary. We obtain the same dependence on the dimension (n 3/2) as that exhibited by Dani et al. The results of this paper rest firmly on those of [8] and the remarkable technique of Auer et al. [2] for obtaining high probability bounds via optimistic estimates. This paper answers an open question: it eliminates the gap between the high-probability bounds obtained in the full-information vs bandit settings.
Resumo:
A diagnostic method based on Bayesian Networks (probabilistic graphical models) is presented. Unlike conventional diagnostic approaches, in this method instead of focusing on system residuals at one or a few operating points, diagnosis is done by analyzing system behavior patterns over a window of operation. It is shown how this approach can loosen the dependency of diagnostic methods on precise system modeling while maintaining the desired characteristics of fault detection and diagnosis (FDD) tools (fault isolation, robustness, adaptability, and scalability) at a satisfactory level. As an example, the method is applied to fault diagnosis in HVAC systems, an area with considerable modeling and sensor network constraints.
Resumo:
We provide an algorithm that achieves the optimal regret rate in an unknown weakly communicating Markov Decision Process (MDP). The algorithm proceeds in episodes where, in each episode, it picks a policy using regularization based on the span of the optimal bias vector. For an MDP with S states and A actions whose optimal bias vector has span bounded by H, we show a regret bound of ~ O(HS p AT ). We also relate the span to various diameter-like quantities associated with the MDP, demonstrating how our results improve on previous regret bounds.
Resumo:
We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuous-valued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem to adversarial scenarios, while also improving on their results in the iid setup. The resulting algorithms are efficient, and perform well in simulations under stochastic and adversarial inputs.
Resumo:
This special feature section of Journal of Management & Organization (Volume 17/1 - March 2011) sets out to widen understanding of the processes of stability and change in today's organizations, with a particular emphasis on the contribution of institutional approaches to organizational studies. Institutional perspectives on organization theory assume that rational, economic calculations, such as the maximization of profits or the optimization of resource allocation, are not sufficient to understand the behavior of organizations and their strategic choices. Institutionalists acknowledge the great uncertainty associated with the conduct of organizations and suggest that taken-for-granted values, beliefs and meanings within and outside organizations also play an important role in the determination of legitimate action.
Resumo:
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric δ against an oblivious adversary. Restricting our attention to the class of “work-based” algorithms, we provide a framework for designing algorithms that uses the technique of regularization. For the case when δ is a uniform metric, we exhibit two algorithms that arise from this framework, and we prove a bound on the competitive ratio of each. We show that the second of these algorithms is ln n + O(loglogn) competitive, which is the current state-of-the art for the uniform MTS problem.
Resumo:
The primary genetic risk factor in multiple sclerosis (MS) is the HLA-DRB1*1501 allele; however, much of the remaining genetic contribution to MS has yet to be elucidated. Several lines of evidence support a role for neuroendocrine system involvement in autoimmunity which may, in part, be genetically determined. Here, we comprehensively investigated variation within eight candidate hypothalamic-pituitary-adrenal (HPA) axis genes and susceptibility to MS. A total of 326 SNPs were investigated in a discovery dataset of 1343 MS cases and 1379 healthy controls of European ancestry using a multi-analytical strategy. Random Forests, a supervised machine-learning algorithm, identified eight intronic SNPs within the corticotrophin-releasing hormone receptor 1 or CRHR1 locus on 17q21.31 as important predictors of MS. On the basis of univariate analyses, six CRHR1 variants were associated with decreased risk for disease following a conservative correction for multiple tests. Independent replication was observed for CRHR1 in a large meta-analysis comprising 2624 MS cases and 7220 healthy controls of European ancestry. Results from a combined meta-analysis of all 3967 MS cases and 8599 controls provide strong evidence for the involvement of CRHR1 in MS. The strongest association was observed for rs242936 (OR = 0.82, 95% CI = 0.74-0.90, P = 9.7 × 10-5). Replicated CRHR1 variants appear to exist on a single associated haplotype. Further investigation of mechanisms involved in HPA axis regulation and response to stress in MS pathogenesis is warranted. © The Author 2010. Published by Oxford University Press. All rights reserved.
Resumo:
Background: Cabergoline is an ergotamine derivative that increases the expression of glial cell line-derived neurotrophic factor (GDNF) in vitro. We recently showed that GDNF in the ventral tegmental area (VTA) reduces the motivation to consume alcohol. We therefore set out to determine whether cabergoline administration decreases alcohol-drinking and -seeking behaviors via GDNF. Methods: Reverse transcription polymerase chain reaction (RT-PCR) and Enzyme-Linked ImmunoSorbent Assay (ELISA) were used to measure GDNF levels. Western blot analysis was used for phosphorylation experiments. Operant self-administration in rats and a two-bottle choice procedure in mice were used to assess alcohol-drinking behaviors. Instrumental performance tested during extinction was used to measure alcohol-seeking behavior. The [35S]GTPγS binding assay was used to assess the expression and function of the dopamine D2 receptor (D2R). Results: We found that treatment of the dopaminergic-like cell line SH-SY5Y with cabergoline and systemic administration of cabergoline in rats resulted in an increase in GDNF level and in the activation of the GDNF pathway. Cabergoline treatment decreased alcohol-drinking and -seeking behaviors including relapse, and its action to reduce alcohol consumption was localized to the VTA. Finally, the increase in GDNF expression and the decrease in alcohol consumption by cabergoline were abolished in GDNF heterozygous knockout mice. Conclusions: Together, these findings suggest that cabergoline-mediated upregulation of the GDNF pathway attenuates alcohol-drinking behaviors and relapse. Alcohol abuse and addiction are devastating and costly problems worldwide. This study puts forward the possibility that cabergoline might be an effective treatment for these disorders. © 2009 Society of Biological Psychiatry.
Resumo:
The gastric-derived orexigenic peptide ghrelin affects brain circuits involved in energy balance as well as in reward. Indeed, ghrelin activates an important reward circuit involved in natural- as well as drug-induced reward, the cholinergic-dopaminergic reward link. It has been hypothesized that there is a common reward mechanism for alcohol and sweet substances in both animals and humans. Alcohol dependent individuals have higher craving for sweets than do healthy controls and the hedonic response to sweet taste may, at least in part, depend on genetic factors. Rat selectively bred for high sucrose intake have higher alcohol consumption than non-sucrose preferring rats and vice versa. In the present study a group of alcohol-consuming individuals selected from a population cohort was investigated for genetic variants of the ghrelin signalling system in relation to both their alcohol and sucrose consumption. Moreover, the effects of GHS-R1A antagonism on voluntary sucrose- intake and operant self-administration, as well as saccharin intake were investigated in preclinical studies using rodents. The effects of peripheral grelin administration on sucrose intake were also examined. Here we found associations with the ghrelin gene haplotypes and increased sucrose consumption, and a trend for the same association was seen in the high alcohol consumers. The preclinical data show that a GHS-R1A antagonist reduces the intake and self-administration of sucrose in rats as well as saccharin intake in mice. Further, ghrelin increases the intake of sucrose in rats. Collectively, our data provide a clear indication that the GHS-R1A antagonists reduces and ghrelin increases the intake of rewarding substances and hence, the central ghrelin signalling system provides a novel target for the development of drug strategies to treat addictive behaviours. © 2011 Landgren et al.