نتایج جستجو برای: risk minimization
تعداد نتایج: 973401 فیلتر نتایج به سال:
it is definitely necessary to understand the concept and behavior of causation of life insurance policies and its determinants for insurance managers, regulators, and customers. for insurance managers, the profitability and liquidity of insurers can be increasingly influenced by the number of causation through costs, adverse selection, and cash surrender values. therefore, causation is a materi...
We study conditional risk minimization (CRM), i.e. the problem of learning a hypothesis of minimal risk for prediction at the next step of a sequentially arriving dependent data. Despite it being a fundamental problem, successful learning in the CRM sense has so far only been demonstrated using theoretical algorithms that cannot be used for real problems as they would require storing all incomi...
In this paper, we initiate a systematic investigation of differentially private algorithms for convex empirical risk minimization. Various instantiations of this problem have been studied before. We provide new algorithms and matching lower bounds for private ERM assuming only that each data point’s contribution to the loss function is Lipschitz bounded and that the domain of optimization is bo...
Privacy-preserving machine learning algorithms are crucial for the increasingly common setting in which personal data, such as medical or financial records, are analyzed. We provide general techniques to produce privacy-preserving approximations of classifiers learned via (regularized) empirical risk minimization (ERM). These algorithms are private under the ε-differential privacy definition du...
Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial examples. In this work, we propose mixup, a simple learning principle to alleviate these issues. In essence, mixup trains a neural network on convex combinations of pairs of examples and their labels. By doing so, mixup regularizes the neural network to favor simple lin...
Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial examples. In this work, we propose mixup, a simple learning principle to alleviate these issues. In essence, mixup trains a neural network on convex combinations of pairs of examples and their labels. By doing so, mixup regularizes the neural network to favor simple lin...
Optimum allocation on inputs is more difficult when there are several objectives in agriculture activities. For this, it is necessary using methods that several objectives approximate to ideal point simultaneously. IN addition, no attention to farmer preferences in farm planning causes the troubles for farmers in accepting planning. So in present study it is tried to attention these subjects wi...
This paper addresses the risk-minimization problem, with and without mortality securitization, à la Föllmer–Sondermann for a large class of equity-linked contracts when no model death time is specified. framework includes situations in which correlation between market arbitrary general, hence leads to case where there are two levels information—the public information, generated by financial ass...
Optimum allocation on inputs is more difficult when there are several objectives in agriculture activities. For this, it is necessary using methods that several objectives approximate to ideal point simultaneously. IN addition, no attention to farmer preferences in farm planning causes the troubles for farmers in accepting planning. So in present study it is tried to attention these subjects wi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید