Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption

2019 ◽  
pp. 247-259 ◽  
Author(s):  
Lane A. Hemaspaandra ◽  
David E. Narváez
Keyword(s):  
Weak Assumption

Equilibrium Uniqueness in a Cournot Model with Demand Uncertainty

2006 ◽  
Vol 6 (1) ◽  
Author(s):  
Johan N.M. Lagerlöf
Keyword(s):  
Hazard Rate ◽  
Demand Uncertainty ◽  
Demand Function ◽  
Market Price ◽  
Cournot Model ◽  
Weak Assumption ◽  
Equilibrium Uniqueness ◽  
Linear Demand ◽  
Uniqueness Of Equilibrium ◽  
Monotone Hazard Rate

If Cournot oligopolists face uncertainty about the intercept of a linear demand function and if the realized market price must be non-negative, then expected demand becomes convex, which can create a multiplicity of equilibria. This note shows that if the distribution of the demand intercept has a monotone hazard rate and if another, rather weak, assumption is satisfied, then uniqueness of equilibrium is guaranteed.

scholarly journals Density of half-horocycles on geometrically infinite hyperbolic surfaces

2012 ◽  
Vol 33 (4) ◽  
pp. 1162-1177
Author(s):  
BARBARA SCHAPIRA
Keyword(s):  
Tangent Bundle ◽  
Hyperbolic Surface ◽  
Hyperbolic Surfaces ◽  
Weak Assumption ◽  
Unit Tangent Bundle

AbstractOn the unit tangent bundle of a hyperbolic surface, we study the density of positive orbits $(h^s v)_{s\ge 0}$ under the horocyclic flow. More precisely, given a full orbit $(h^sv)_{s\in {\mathbb R}}$, we prove that under a weak assumption on the vector $v$, both half-orbits $(h^sv)_{s\ge 0}$ and $(h^s v)_{s\le 0}$ are simultaneously dense or not in the non-wandering set $\mathcal {E}$of the horocyclic flow. We give also a counterexample to this result when this assumption is not satisfied.

scholarly journals A SYSTEMATIC REVIEW OF STRUCTURAL EQUATION MODEL (SEM)

2020 ◽  
Vol 1 (2) ◽  
pp. 27-39
Author(s):  
H. O. Owolabi ◽  
J. K. Ayandele ◽  
D. D. Olaoye
Keyword(s):  
Structural Equation Model ◽  
Measurement Errors ◽  
Structural Equation ◽  
Statistical Technique ◽  
Equation Model ◽  
Equation Modeling ◽  
Weak Assumption ◽  
Multivariate Statistical ◽  
Software Packages ◽  
Complex Relationships

Structural Equation Model (SEM) is a multivariate statistical technique that has been explored to test relationships between variables. The use of SEM to analyze relationship between variables is premised on the weak assumption of path analysis, regression analysis and so on; that variables are measured without error. This review thus sheds light on the meaning of SEM, its assumptions, steps and some of the terms used in SEM. The importance of item parcelling to SEM and its methods were briefly examined. It also dealt on the stages involved in SEM, similarities and differences between SEM and conventional statistical methods, software packages that can be used for SEM. This article employed systematic literature review method because it critically synthesized research studies and findings on structural equation modeling (SEM). It could be concluded that SEM is useful in analyzing a set of relationships between variables using diagrams. SEM can also be useful in minimizing measurement errors and in enhancing reliability of constructs. Based on this, it is recommended that SEM should be employed to test relationship between variables since it can explore complex relationships among variables such as direct, indirect, spurious, hierarchical and non-hierarchical.

scholarly journals Adversarial Training Based Multi-Source Unsupervised Domain Adaptation for Sentiment Analysis

2020 ◽  
Vol 34 (05) ◽  
pp. 7618-7625
Author(s):  
Yong Dai ◽  
Jian Liu ◽  
Xiancong Ren ◽  
Zenglin Xu
Keyword(s):  
Sentiment Analysis ◽  
Domain Adaptation ◽  
State Of The Art ◽  
Weak Assumption ◽  
Target Domain ◽  
Smoothness Assumption ◽  
Unsupervised Domain Adaptation ◽  
Good Target ◽  
Adversarial Training ◽  
Learning Frameworks

Multi-source unsupervised domain adaptation (MS-UDA) for sentiment analysis (SA) aims to leverage useful information in multiple source domains to help do SA in an unlabeled target domain that has no supervised information. Existing algorithms of MS-UDA either only exploit the shared features, i.e., the domain-invariant information, or based on some weak assumption in NLP, e.g., smoothness assumption. To avoid these problems, we propose two transfer learning frameworks based on the multi-source domain adaptation methodology for SA by combining the source hypotheses to derive a good target hypothesis. The key feature of the first framework is a novel Weighting Scheme based Unsupervised Domain Adaptation framework ((WS-UDA), which combine the source classifiers to acquire pseudo labels for target instances directly. While the second framework is a Two-Stage Training based Unsupervised Domain Adaptation framework (2ST-UDA), which further exploits these pseudo labels to train a target private extractor. Importantly, the weights assigned to each source classifier are based on the relations between target instances and source domains, which measured by a discriminator through the adversarial training. Furthermore, through the same discriminator, we also fulfill the separation of shared features and private features.Experimental results on two SA datasets demonstrate the promising performance of our frameworks, which outperforms unsupervised state-of-the-art competitors.

Straight Versus Constrained Maximization

1993 ◽  
Vol 23 (1) ◽  
pp. 25-54 ◽  
Author(s):  
Jordan Howard Sobel
Keyword(s):  
Expected Utility ◽  
The Body ◽  
Weak Assumption ◽  
David Gauthier ◽  
Prisoners Dilemma ◽  
Constrained Maximization ◽  
Good For

David Gauthier stages a competition between two arguments, each of which purports to decide once for all transparent agents which is best, being a straight or being a constrained maximizer. The first argument, which he criticizes and rejects, is for the greater utility, on a certain weak assumption, of straight maximization for all transparent agents. The second, which he endorses, is for the greater utility on the same weak assumption of constrained maximization for all transparent agents.In Section I, Gauthier’s account of constrained maximization is presented, and his use in the two arguments of the idea of choosing a disposition to choose actions is noted. Section II is about the unfortunate argument that Gauthier criticizes. This argument is flawed in ways additional to those he notices, but a less ambitious form of reasoning can, for individuals whose probabilities and values are right, be good for the greater expected utility of straight maximization. Section III takes up the argument that Gauthier endorses and maintains that it is wrong in a way specific to it as well as in ways closely related to all of the first argument’s noted flaws. An Appendix features a three-person prisoners’ dilemma and includes demonstrations of principal conclusions reached in the body of this paper.

Zeros of linear combinations of orthogonal polynomials

1995 ◽  
Vol 117 (3) ◽  
pp. 533-544 ◽  
Author(s):  
Franz Peherstorfer
Keyword(s):  
Distribution Function ◽  
Orthogonal Polynomials ◽  
Unit Circle ◽  
Weak Assumption ◽  
Linear Combinations ◽  
Simple Zeros ◽  
Jacobi Weights

AbstractLet ψ be a distribution function on [−1,1] from the Szegö-class, which contains in particular all Jacobi weights, and let (pn) be the monic polynomials orthogonal with respect to dψ. Let m(n)∈ℕ, n∈ℕ, be non-decreasing with limn → ∞ (n − m(n)) = ∞, l(n)∈ℕ with 0 ≤ l(n) ≤ m(n), and μj, n ∈ℝ for j = 0, …, m(n), n∈ℕ. It is shown that for each sufficiently large n, has n−l(n) simple zeros in (−1, 1)and l(n) zeros in ℂ\[−1,1] if for n ≥ n0, has m(n) − l(n) zeros in the disc |z| ≤ r < 1, l(n) zeros outside of the disc |z| ≥ R > 1 and where q > 2 max {r, 1/R}. If m(n) is constant for n ≥ n0 then the statement holds even for such polynomials (pn) orthogonal with respect to a distribution dψ satisfying the weak assumption ψ′ > 0 a.e. on [−1, 1]. For linear combinations of polynomials orthogonal on the unit circle corresponding results are derived.

scholarly journals Intrinsic Dispositional Properties and Immanent Realism

2018 ◽  
Vol 95 (4) ◽  
pp. 500-519
Author(s):  
Vassilis Livanios
Keyword(s):  
Weak Assumption ◽  
Dispositional Properties

Tugby (2013a) and Yates (2016) have recently argued that immanent realism is incompatible with the existence of intrinsic but (at least partially) relationally constituted genuine dispositional properties. The success of Tugby’s and Yates’ arguments depends either on a strong or on a weak assumption about the interworld identity of dispositional properties. In this paper, the author evaluates the strength of the arguments in question under those two assumptions. He also offers an alternative metaphysical picture for the fundamental dispositional properties which rejects these assumptions and, consequently, undermines the arguments themselves.

Weak assumption and iterative admissibility

2015 ◽  
Vol 158 ◽  
pp. 87-101 ◽  
Author(s):  
Chih-Chun Yang
Keyword(s):  
Weak Assumption

scholarly journals A Smoothing Newton Method with a Mixed Line Search for Monotone Weighted Complementarity Problems

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Xiaoqin Jiang ◽  
He Huang
Keyword(s):  
Newton Method ◽  
Complementarity Problem ◽  
Line Search ◽  
Complementarity Problems ◽  
Linear Equations ◽  
Step Length ◽  
Smoothing Newton Method ◽  
System Of Linear Equations ◽  
Weak Assumption ◽  
Mixed Line

In this paper, we present a smoothing Newton method for solving the monotone weighted complementarity problem (WCP). In each iteration of our method, the iterative direction is achieved by solving a system of linear equations and the iterative step length is achieved by adopting a line search. A feature of the line search criteria used in this paper is that monotone and nonmonotone line search are mixed used. The proposed method is new even when the WCP reduces to the standard complementarity problem. Particularly, the proposed method is proved to possess the global convergence under a weak assumption. The preliminary experimental results show the effectiveness and robustness of the proposed method for solving the concerned WCP.

Sign in / Sign up

Export Citation Format

Share Document