Xem 1-9 trên 9 kết quả Convex optimization
  • mathematical optimization least-squares and linear programming convex optimization example course goals and topics nonlinear optimization brief history of convex optimization

    pdf298p hgiang 11-03-2009 86 14   Download

  • Contrary to popular belief, we show that the optimal parameters for IBM Model 1 are not unique. We demonstrate that, for a large class of words, IBM Model 1 is indifferent among a continuum of ways to allocate probability mass to their translations. We study the magnitude of the variance in optimal model parameters using a linear programming approach as well as multiple random trials, and demonstrate that it results in variance in test set log-likelihood and alignment error rate.

    pdf6p hongdo_1 12-04-2013 13 2   Download

  • In everyday life we are often forced to make decisions involving risks and perceived opportunities. The consequences of our decisions are affected by the outcomes of random variables that are to various degrees beyond our control. Such decision problems arise, for instance, in financial and insurance markets.

    pdf350p namde02 08-03-2013 33 18   Download

  • Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article The Optimal Convex Combination Bounds for Seiffert’s Mean

    pdf9p sting05 09-02-2012 19 3   Download

  • Research Article Optimality Conditions of Globally Efficient Solution for Vector Equilibrium Problems with Generalized Convexity

    pdf13p dauphong17 22-02-2012 26 2   Download

  • Necessary and sufficient conditions for ε -optimal solutions of convex infinite programming problems are established. These Kuhn-Tucker type conditions are derived based on a new version of Farkas' lemma proposed recently. Conditions for ε -duality and ε -saddle points are also given. Keywords: ε -solution, ε -duality, ε -saddle point.

    pdf10p phalinh19 20-08-2011 22 1   Download

  • Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Optimality Conditions and Duality for DC Programming in Locally Convex Spaces

    pdf10p sting09 22-02-2012 21 1   Download

  • In this paper, we present a supervised learning approach to training submodular scoring functions for extractive multidocument summarization. By taking a structured prediction approach, we provide a large-margin method that directly optimizes a convex relaxation of the desired performance measure.

    pdf10p bunthai_1 06-05-2013 12 2   Download

  • When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural language problems is piecewise constant and riddled with local minima, many systems instead optimize log-likelihood, which is conveniently differentiable and convex. We propose training instead to minimize the expected loss, or risk. We define this expectation using a probability distribution over hypotheses that we gradually sharpen (anneal) to focus on the 1-best hypothesis. ...

    pdf8p hongvang_1 16-04-2013 11 1   Download

Đồng bộ tài khoản