The effects of weight loss strategies on gastric emptying and appetite control

The gastrointestinal tract plays an important role in the improved appetite control and weight loss in response to bariatric surgery. Other strategies which similarly alter gastrointestinal responses to food intake could contribute to successful weight management. The aim of this review is to discuss the effects of surgical, pharmacological and behavioural weight loss interventions on gastrointestinal targets of appetite control, including gastric emptying. Gastrointestinal peptides are also discussed because of their integrative relationship in appetite control. This review shows that different strategies exert diverse effects and there is no consensus on the optimal strategy for manipulating gastric emptying to improve appetite control. Emerging evidence from surgical procedures (e.g., sleeve gastrectomy and Roux en-Y gastric bypass) suggests a faster emptying rate and earlier delivery of nutrients to the distal small intestine may improve appetite control. Energy restriction slows gastric emptying, while the effect of exercise-induced weight loss on gastric emptying remains to be established. The limited evidence suggests that chronic exercise is associated with faster gastric emptying which we hypothesise will impact on appetite control and energy balance. Understanding how behavioural weight loss interventions (e.g., diet and exercise) alter gastrointestinal targets of appetite control may be important to improve their success in weight management.

Consumers’ intentions to adopt 3G in regional cities in China : a comparative study

Rapid mobile technological evolution and the large economic stake in commercial development of mobile technological innovation make it necessary to understand consumers' motivations towards the latest advanced and updated technologies and services. 3G (the third generation of mobile communication technology) recently started its commercial development in the world‘s largest mobile communication market, China, after being delayed for a few years. Although China fell behind in commercially developing 3G, it is difficult to ignore studying this area, given the size of the market and promising future developments. This market deserves focused research attention, especially in terms of consumer behaviour towards the adoption of mobile technological innovation. Thus, the program of research in this thesis was designed to investigate how Chinese consumers respond to the use of this newly launched mobile technological innovation, with a focus on what factors affect their 3G adoption intentions. It aimed to yield important insights into Chinese consumers‘ innovation adoption behaviours and to contribute to marketing and innovation adoption research. Furthermore, it has been documented that Chinese consumers vary widely between regions in dialect, lifestyle, culture, purchasing power and consumption attitudes. Based on economic development and local culture, China can be divided geographically into distinctive regional consumer markets. Consequently, the results of consumer behaviour research in one region may not necessarily be extrapolated to other regions. In order to better understand Chinese consumers, the disparities between regions should not be overlooked. Therefore, another objective of this program of research was to examine regional variances in consumers' innovation adoption, specifically to identify the similarities and differences in factors influencing 3G adoption, contributing to intra-cultural studies. An extensive literature review identified two gaps: current China-based innovation adoption research studies are limited in providing adequate prediction and explanation of Chinese consumers' intentions to adopt 3G; and there was limited knowledge about the differences between regional Chinese consumers in innovation adoption. Two research questions therefore were developed to address these gaps: 1) What factors influence Chinese consumers' intentions to adopt 3G? 2) How do Chinese consumers differ between regional markets in the relative influence of the factors in determining their intentions to adopt 3G? In accordance with postpositivist research philosophy, two studies were designed to answer the research questions, using mixed methods. To meet the research objectives, the two studies were both conducted in three regional cities, namely Beijing, Shanghai and Wuhan, centred in the three regions of North China, East China and Central China respectively, with sufficient cultural and economical regional variances. Study One was an exploratory study with qualitative research methods. It involved 45 in-depth interviews in the three research cities to gain rich insights into the research context from natural settings. Eight important concepts related to 3G adoption were generated from analysis of the interview data, namely utilitarian expectation, hedonic expectation, status gains, status loss avoidance, normative influence, external influence, cost and quality concern. The concepts of social loss avoidance and quality concern were two unique findings, whereas the other concepts were similar to the findings in Western innovation adoption studies. Moreover, variances in 3G adoption between three groups of regional consumers were also identified, focusing on the perceptions of two concepts, namely status gains and normative influence. The conceptual research model was then developed incorporating the eight concepts plus the dependent variable of adoption intention. The hypothesized relationships between the nine constructs and hypotheses about the differences between regional consumers in 3G adoption were informed by the findings of Study One and the literature reviewed. Study Two was a quantitative study involving a web-based survey and statistical analysis procedure. The web-based survey attracted 800 residents from the three research cities, 270 from Beijing, 265 from Shanghai and 265 from Wuhan. They comprised three research samples for this study and consequently three sets of data were obtained. The data was analysed by Structural Equation Modelling together with Multi-group Analysis. The analysis confirmed that the concepts generated in Study One were influential factors affecting Chinese consumers' 3G adoption intention, with the exception of the concept external influence. Differences were found between the samples in the three research cities in the effect of hedonic expectation, status gains, status loss avoidance and normative influence on 3G adoption intention. The two Studies undertaken in this thesis contributed a better understanding of Chinese consumers' intentions to adopt advanced mobile technological innovation, namely 3G, in three regional markets. This knowledge contributes to innovation adoption and intra-cultural research, as well as consumer behaviour theory. It is also able to inform international and domestic telecommunication companies to develop and deliver more effective marketing strategies across Chinese regional markets. Limitations in the research were identified in terms of the sampling techniques used and the design of the two Studies. Future research was suggested in other Chinese regional markets and into consumer adoption of other types of mobile technological innovations.

Practical stability of approximating discrete-time filters with respect to model mismatch using relative entropy concepts

This paper establishes practical stability results for an important range of approximate discrete-time filtering problems involving mismatch between the true system and the approximating filter model. Using local consistency assumption, the practical stability established is in the sense of an asymptotic bound on the amount of bias introduced by the model approximation. Significantly, these practical stability results do not require the approximating model to be of the same model type as the true system. Our analysis applies to a wide range of estimation problems and justifies the common practice of approximating intractable infinite dimensional nonlinear filters by simpler computationally tractable filters.

Rademacher and Gaussian complexities: Risk bounds and structural results

We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we prove general risk bounds in terms of these complexities. We consider function classes that can be expressed as combinations of functions from basis classes and show how the Rademacher and Gaussian complexities of such a function class can be bounded in terms of the complexity of the basis classes. We give examples of the application of these techniques in finding data-dependent risk bounds for decision trees, neural networks and support vector machines.

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d = VC(F) bound on the graph density of a subgraph of the hypercube—oneinclusion graph. The first main result of this paper is a density bound of n [n−1 <=d-1]/[n <=d] < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d contractible simplicial complexes, extending the well-known characterization that d = 1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VCdimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(logn) and is shown to be optimal up to an O(logk) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout.

Corrigendum to “Shifting : one-inclusion mistake bounds and sample compression” [J. Comput. System Sci. 75 (1) (2009) 37–59]

H. Simon and B. Szörényi have found an error in the proof of Theorem 52 of “Shifting: One-inclusion mistake bounds and sample compression”, Rubinstein et al. (2009). In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is again in terms of the capacity of the multilabel concept class. Simon and Szörényi have recently proved an alternate result in Simon and Szörényi (2009).

Fast rates for estimation error and oracle inequalities for model section

We consider complexity penalization methods for model selection. These methods aim to choose a model to optimally trade off estimation and approximation errors by minimizing the sum of an empirical risk term and a complexity penalty. It is well known that if we use a bound on the maximal deviation between empirical and true risks as a complexity penalty, then the risk of our choice is no more than the approximation error plus twice the complexity penalty. There are many cases, however, where complexity penalties like this give loose upper bounds on the estimation error. In particular, if we choose a function from a suitably simple convex function class with a strictly convex loss function, then the estimation error (the difference between the risk of the empirical risk minimizer and the minimal risk in the class) approaches zero at a faster rate than the maximal deviation between empirical and true risks. In this paper, we address the question of whether it is possible to design a complexity penalized model selection method for these situations. We show that, provided the sequence of models is ordered by inclusion, in these cases we can use tight upper bounds on estimation error as a complexity penalty. Surprisingly, this is the case even in situations when the difference between the empirical risk and true risk (and indeed the error of any estimate of the approximation error) decreases much more slowly than the complexity penalty. We give an oracle inequality showing that the resulting model selection method chooses a function with risk no more than the approximation error plus a constant times the complexity penalty.

Correction to “The Importance of Convexity in Learning With Squared Loss” [Sep 98 1974-1980]

The paper "the importance of convexity in learning with squared loss" gave a lower bound on the sample complexity of learning with quadratic loss using a nonconvex function class. The proof contains an error. We show that the lower bound is true under a stronger condition that holds for many cases of interest.

Online discovery of similarity mappings

We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated with the chosen assignment, and the goal is to minimize the cumulative loss of these choices relative to the best map on the entire sequence. Even though the offline problem of finding the best map is provably hard, we show that there is an equivalent online approximation algorithm, Randomized Map Prediction (RMP), that is efficient and performs nearly as well. While drawing upon results from the "Online Prediction with Expert Advice" setting, we show how RMP can be utilized as an online approach to several standard batch problems. We apply RMP to online clustering as well as online feature selection and, surprisingly, RMP often outperforms the standard batch algorithms on these problems.

Classification with a reject option using a hinge loss

We consider the problem of binary classification where the classifier can, for a particular cost, choose not to classify an observation. Just as in the conventional classification problem, minimization of the sample average of the cost is a difficult optimization problem. As an alternative, we propose the optimization of a certain convex loss function φ, analogous to the hinge loss used in support vector machines (SVMs). Its convexity ensures that the sample average of this surrogate loss can be efficiently minimized. We study its statistical properties. We show that minimizing the expected surrogate loss—the φ-risk—also minimizes the risk. We also study the rate at which the φ-risk approaches its minimum value. We show that fast rates are possible when the conditional probability P(Y=1|X) is unlikely to be close to certain critical values.

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d=VC(F) bound on the graph density of a subgraph of the hypercube—one-inclusion graph. The first main result of this report is a density bound of n∙choose(n-1,≤d-1)/choose(n,≤d) < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d-contractible simplicial complexes, extending the well-known characterization that d=1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VC-dimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(log n) and is shown to be optimal up to a O(log k) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout

Relative entropy rate based design for linear hybrid system models

Hybrid system representations have been applied to many challenging modeling situations. In these hybrid system representations, a mixture of continuous and discrete states is used to capture the dominating behavioural features of a nonlinear, possible uncertain, model under approximation. Unfortunately, the problem of how to best design a suitable hybrid system model has not yet been fully addressed. This paper proposes a new joint state measurement relative entropy rate based approach for this design purpose. Design examples and simulation studies are presented which highlight the benefits of our proposed design approaches.