BSDEs under partial information and financial applications

In this paper we provide existence and uniqueness results for the solution of BSDEs driven by a general square-integrable martingale under partial information. We discuss some special cases where the solution to a BSDE under restricted information can be derived by that related to a problem of a BSDE under full information. In particular, we provide a suitable version of the Föllmer–Schweizer decomposition of a square-integrable random variable working under partial information and we use this achievement to investigate the local risk-minimization approach for a semimartingale financial market model.     

Reducing asymptotic bias of weak instrumental estimation using independently repeated cross-sectional information

In this paper, we consider the instrumental variable estimation (the two-stage least squares estimator and the limited information maximum likelihood estimator) using weak instruments in a repeated measurements or a panel data model. We show that independently repeated cross-sectional data can reduce the asymptotic bias of the instrumental variable estimation when instruments are weakly correlated with endogenous variables. When the number of repeated measurements tends to infinity, we can achieve consistent instrumental variable estimation with weak instruments.     

Distribution estimation with smoothed auxiliary information

Distribution estimation is very important in order to make statistical inference for parameters or its functions based on this distribution.In this work we propose an estimator of the distribution of some variable with non-smooth auxiliary information,for example,a symmetric distribution of this variable.A smoothing technique is employed to handle the non-differentiable function.Hence,a distribution can be estimated based on smoothed auxiliary information.Asymptotic properties of the distribution estimator are derived and analyzed.The distribution estimators based on our method are found to be significantly efficient than the corresponding estimators without these auxiliary information.Some simulation studies are conducted to illustrate the finite sample performance of the proposed estimators.     

Random sets as imprecise random variables

Given a random set coming from the imprecise observation of a random variable, we study how to model the information about the probability distribution of this random variable. Specifically, we investigate whether the information given by the upper and lower probabilities induced by the random set is equivalent to the one given by the class of the probabilities induced by the measurable selections; together with sufficient conditions for this, we also give examples showing that they are not equivalent in all cases.     

Information-based branching schemes for binary linear mixed integer problems

Branching variable selection can greatly affect the effectiveness and efficiency of a branch-and-bound algorithm. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We propose an approach which is empowered by exploiting the information contained in a family of fathomed subproblems, collected beforehand from an incomplete branch-and-bound tree. In particular, we use this information to define new branching rules that reduce the risk of incurring inappropriate branchings. We provide computational results that demonstrate the effectiveness of the new branching rules on various benchmark instances.     

A Partial Order on Uncertainty and Information

Information and uncertainty are closely related and extensively studied concepts in a number of scientific disciplines such as communication theory, probability theory, and statistics. Increasing the information arguably reduces the uncertainty on a given random subject. Consider the uncertainty measure as the variance of a random variable. Given the information that its outcome is in an interval, the uncertainty is expected to reduce when the interval shrinks. This proposition is not generally true. In this paper, we provide a necessary and sufficient condition for this proposition when the random variable is absolutely continuous or integer valued. We also give a similar result on Shannon information.     

Updating preconditioners for modified least squares problems

In this paper, we analyze how to update incomplete Cholesky preconditioners to solve least squares problems using iterative methods when the set of linear relations is updated with some new information, a new variable is added or, contrarily, some information or variable is removed from the set. Our proposed method computes a low-rank update of the preconditioner using a bordering method which is inexpensive compared with the cost of computing a new preconditioner. Moreover, the numerical experiments presented show that this strategy gives, in many cases, a better preconditioner than other choices, including the computation of a new preconditioner from scratch or reusing an existing one.     

带有Radon-Nikodym导数的算子值自由Fisher信息量

本文研究了带有Radon-Nikodym导数的算子值自由Fisher信息量.利用模框架理论,得到了一个半圆元和一个子代数之间的合并自由关系,推广了D.Voiculescu等人的工作.     

Optimal information acquisition for a linear quadratic control problem

This paper develops a generalization of the linear quadratic control problem with partial information. As in the standard partial information setting, it is assumed that the state variable is only observed with noise. The idea in this paper is that the information level may be chosen optimally. In real life information is costly to acquire. It is therefore a trade off between the costs of getting detailed information and the increased value this information gives. We believe that the technique we present should have potential for application within both economics and engineering.     

多源数据合成方法及其在个体创造力研究中的应用

针对目前利用多源数据的测量方法,指出现有研究方法存在的问题和可能导致的结果偏差,提出应对测量同一事物(构念、变量)的多源数据进行合成,并基于量表信度和结构效度检验的思想,给出其合成的合理性和可行性,探讨来自不同测评方所含信息的权重设计,并以变革型领导和个体创造力的研究为例进行分析.     

Distributionally robust mixed integer linear programs: Persistency models with applications

In this paper, we review recent advances in the distributional analysis of mixed integer linear programs with random objective coefficients. Suppose that the probability distribution of the objective coefficients is incompletely specified and characterized through partial moment information. Conic programming methods have been recently used to find distributionally robust bounds for the expected optimal value of mixed integer linear programs over the set of all distributions with the given moment information. These methods also provide additional information on the probability that a binary variable attains a value of 1 in the optimal solution for 0–1 integer linear programs. This probability is defined as the persistency of a binary variable. In this paper, we provide an overview of the complexity results for these models, conic programming formulations that are readily implementable with standard solvers and important applications of persistency models. The main message that we hope to convey through this review is that tools of conic programming provide important insights in the probabilistic analysis of discrete optimization problems. These tools lead to distributionally robust bounds with applications in activity networks, vertex packing, discrete choice models, random walks and sequencing problems, and newsvendor problems.     

On the convergence of CQ algorithm with variable steps for the split equality problem

We investigate CQ algorithm for the split equality problem in Hilbert spaces. In such an algorithm, the selection of the step requires prior information on the matrix norms, which is not always possible in practice. In this paper, we propose a new way to select the step so that the implementation of the algorithm does not need any prior information of the matrix norms. In Hilbert spaces, we establish the weak convergence of the proposed method to a solution of the problem under weaker conditions than usual. Preliminary numerical experiments show that the efficiency of the proposed algorithm when it applies the variable step-size.     

On the Semisupervised Joint Trained Elastic Net

The elastic net (supervised enet henceforth) is a popular and computationally efficient approach for performing the simultaneous tasks of selecting variables, decorrelation, and shrinking the coefficient vector in the linear regression setting. Semisupervised regression, currently unrelated to the supervised enet, uses data with missing response values (unlabeled) along with labeled data to train the estimator. In this article, we propose the joint trained elastic net (jt-enet), which elegantly incorporates the benefits of semisupervised regression with the supervised enet. The supervised enet and other approaches like it rely on shrinking the linear estimator in a way that simultaneously performs variable selection and decorrelates the data. Both the variable selection and decorrelation components of the supervised enet inherently rely on the pairwise correlation structure in the feature data. In circumstances in which the number of variables is high, the feature data are relatively easy to obtain, and the response is expensive to generate, it seems reasonable that one would want to be able to use any existing unlabeled observations to more accurately define these correlations. However, the supervised enet is not able to incorporate this information and focuses only on the information within the labeled data. In this article, we propose the jt-enet, which allows the unlabeled data to influence the variable selection, decorrelation, and shrinkage capabilities of the linear estimator. In addition, we investigate the impact of unlabeled data on the risk and bias of the proposed estimator. The jt-enet is demonstrated on two applications with encouraging results. Online supplementary material is available for this article.     

Operator-valued free Fisher information and modular frames

We introduce the operator-valued free Fisher information for a random variable in an operator-valued noncommutative probability space and point out its relations to the amalgamated freeness. Using M. Frank and D. Larson's modular frame notion we can construct the conjugate variable for an operator-valued semicircle variable with conditional expectation covariance. Then we obtain its free Fisher information and show it is equal to the index of the conditional expectation. At last the conjugate variable with respect to a modular frame operator for a semicircle variable is also constructed.

     

含语言评价信息的一种模糊多属性群决策方法

对于多属性群决策问题的处理,有时需要采用先决策、后综合的处理方法,而含有语言评价信息的多属性群决策问题,定性目标一般用语言评价信息描述,由决策人给出定性目标和权系数的语言变量评价,用梯形模糊数表示,对定量目标进行无量纲化处理;将决策人对于单一目标的评价指标聚合成多个目标的评价模糊数,采用Bass-Kw akernaak模糊数排序方法对方案进行排序;群体的评价通过Borda函数来集结方案集的群体排序.     

���ڱ���ѡ��;�����������׶��췽��ģ�͹���

The heteroscedasticity is inevitable for the panel data modeling in economics. The two-stage estimation method is a better means to study the heteroscedasticity, in which the basis is to select only one independent variable for samples grouping, it can cause the information used is incomplete. In this paper, we propose to select several variables for grouping using variable selection method, then k-mean algorithm is used to cluster, so the samples classification can be achieved and the heteroscedasticity estimation can be obtained. The results of real example analysis show that the method presented in this paper has obvious advantages in effectiveness and feasibility.     

信息熵公理及其在决策分析中的应用

针对信息量是消息发生前的不确定性给出一个直观测量信息量公式.为了克服Shannon熵的局限性和分析信息度量本质,借鉴距离空间理论中度量公理定义的思路,通过非负性、对称性、次可加和极大性给出信息熵的公理化新定义.将Shannon熵、直观信息熵和β-熵等不同形式的信息度量统一在同一公理化结构下.应用直观信息熵公式仅采用四则运算进行决策树分析,避免了利用Shannon熵公式的对数运算.     

A node rooted flow-based model for the local access network expansion problem

In this paper, we present a new formulation for the local access network expansion problem. Previously, we have shown that this problem can be seen as an extension of the well-known Capacitated Minimum Spanning Tree Problem and have presented and tested two flow-based models. By including additional information on the definition of the variables, we propose a new flow-based model that permits us to use effectively variable eliminations tests as well as coefficient reduction on some of the constraints. We present computational results for instances with up to 500 nodes in order to show the advantages of the new model in comparison with the others.     

Distributionally robust parameter identification of a time-delay dynamical system with stochastic measurements

In this paper, we consider a parameter identification problem involving a time-delay dynamical system, in which the measured data are stochastic variable. However, the probability distribution of this stochastic variable is not available and the only information we have is its first moment. This problem is formulated as a distributionally robust parameter identification problem governed by a time-delay dynamical system. Using duality theory of linear optimization in a probability space, the distributionally robust parameter identification problem, which is a bi-level optimization problem, is transformed into a single-level optimization problem with a semi-infinite constraint. By applying problem transformation and smoothing techniques, the semi-infinite constraint is approximated by a smooth constraint and the convergence of the smooth approximation method is established. Then, the gradients of the cost and constraint functions with respect to time-delay and parameters are derived. On this basis, a gradient-based optimization method for solving the transformed problem is developed. Finally, we present an example, arising in practical fermentation process, to illustrate the applicability of the proposed method.     

一个投资问题的信息结构

本文研究一个投资问题中的信息价值，其中信息可以是不完美的，信息价值依赖于其结构．信息结构由状态变量与信息变量联合概率(或条件概率)矩阵来描述．我们定义了矩阵的一些偏序，通过这些偏序给出了信息价值的比较关系．由这些结果，我们导出了信息价值的一些基本性质．