Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses

The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. A dominant theoretical and algorithmic framework for the problem has been to reduce bipartite ranking to pairwise classification; in particular, it is well known that the bipartite ranking regret can be formulated as a pairwise classification regret, which in turn can be upper bounded using usual regret bounds for classification problems. Recently, Kotlowski et al. (2011) showed regret bounds for bipartite ranking in terms of the regret associated with balanced versions of the standard (non-pairwise) logistic and exponential losses. In this paper, we show that such (non-pairwise) surrogate regret bounds for bipartite ranking can be obtained in terms of a broad class of proper (composite) losses that we term as strongly proper. Our proof technique is much simpler than that of Kotlowski et al. (2011), and relies on properties of proper (composite) losses as elucidated recently by Reid and Williamson (2010, 2011) and others. Our result yields explicit surrogate bounds (with no hidden balancing terms) in terms of a variety of strongly proper losses, including for example logistic, exponential, squared and squared hinge losses as special cases. An important consequence is that standard algorithms minimizing a (non-pairwise) strongly proper loss, such as logistic regression and boosting algorithms (assuming a universal function class and appropriate regularization), are in fact consistent for bipartite ranking; moreover, our results allow us to quantify the bipartite ranking regret in terms of the corresponding surrogate regret. We also obtain tighter surrogate bounds under certain low-noise conditions via a recent result of Clemencon and Robbiano (2011).

A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).

A search for chaos in the optical light curve of a blazar: W2R 1926+42

Aims. In this work we search for the signatures of low-dimensional chaos in the temporal behavior of the Kepler-field blazar W2R 1946+42. Methods. We use a publicly available, similar to 160 000-point-long and mostly equally spaced light curve of W2R 1946+42. We apply the correlation integral method to both real datasets and phase randomized surrogates. Results. We are not able to confirm the presence of low-dimensional chaos in the light curve. This result, however, still leads to some important implications for blazar emission mechanisms, which are discussed.

Outer Bounds on the Sum Rate of the K-User MIMO Gaussian Interference Channel

This paper derives outer bounds on the sum rate of the K-user MIMO Gaussian interference channel (GIC). Three outer bounds are derived, under different assumptions of cooperation and providing side information to receivers. The novelty in the derivation lies in the careful selection of side information, which results in the cancellation of the negative differential entropy terms containing signal components, leading to a tractable outer bound. The overall outer bound is obtained by taking the minimum of the three outer bounds. The derived bounds are simplified for the MIMO Gaussian symmetric IC to obtain outer bounds on the generalized degrees of freedom (GDOF). The relative performance of the bounds yields insight into the performance limits of multiuser MIMO GICs and the relative merits of different schemes for interference management. These insights are confirmed by establishing the optimality of the bounds in specific cases using an inner bound on the GDOF derived by the authors in a previous work. It is also shown that many of the existing results on the GDOF of the GIC can be obtained as special cases of the bounds, e. g., by setting K = 2 or the number of antennas at each user to 1.

Renormalization group invariants and sum rules in the deflected mirage mediation supersymmetry breaking

We examine the deflected mirage mediation supersymmetry breaking (DMMSB) scenario, which combines three supersymmetry breaking scenarios, namely anomaly mediation, gravity mediation and gauge mediation using the one-loop renormalization group invariants (RGIs). We examine the effects on the RGIs at the threshold where the gauge messengers emerge, and derive the supersymmetry breaking parameters in terms of the RGIs. We further discuss whether the supersymmetry breaking mediation mechanism can be determined using a limited set of invariants, and derive sum rules valid for DMMSB below the gauge messenger scale. In addition we examine the implications of the measured Higgs mass for the DMMSB spectrum.

Necessary and sufficient conditions for optimality in constrained general sum stochastic games

In this paper we first derive a necessary and sufficient condition for a stationary strategy to be the Nash equilibrium of discounted constrained stochastic game under certain assumptions. In this process we also develop a nonlinear (non-convex) optimization problem for a discounted constrained stochastic game. We use the linear best response functions of every player and complementary slackness theorem for linear programs to derive both the optimization problem and the equivalent condition. We then extend this result to average reward constrained stochastic games. Finally, we present a heuristic algorithm motivated by our necessary and sufficient conditions for a discounted cost constrained stochastic game. We numerically observe the convergence of this algorithm to Nash equilibrium. (C) 2015 Elsevier B.V. All rights reserved.

Sum Secrecy Rate in Multicarrier DF Relay Beamforming

In this paper, we study sum secrecy rate in multicarrier decode-and-forward relay beamforming. We obtain the optimal source power and relay weights on each subcarrier which maximize the sum secrecy rate. For a given total power on a given subcarrier k, P-0(k), we reformulate the optimization problem by relaxing the rank-1 constraint on the complex positive semidefinite relay weight matrix, and solve using semidefinite programming. We analytically prove that the solution to the relaxed optimization problem is indeed rank 1. We show that the subcarrier secrecy rate, R-s (P-0(k)), is a concave function in total power P-0(k) if R-s (P-0(k)) > 0 for any P-0(k) > 0. Numerical results show that the sum secrecy rate with optimal power allocation across subcarriers is more than the sum secrecy rate with equal power allocation. We also propose a low complexity suboptimal power allocation scheme which outperforms equal power allocation scheme.

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formulas. That is, we give an explicit family of polynomials of degree d on N variables (with N = d(3) in our case) with 0, 1-coefficients such that for any representation of a polynomial f in this family of the form f = Sigma(i) Pi(j) Q(ij), where the Q(ij)'s are homogeneous polynomials (recall that a polynomial is said to be homogeneous if all its monomials have the same degree), it must hold that Sigma(i,j) (Number of monomials of Q(ij)) >= 2(Omega(root d.log N)). The above mentioned family, which we refer to as the Nisan-Wigderson design-based family of polynomials, is in the complexity class VNP. Our work builds on the recent lower bound results 1], 2], 3], 4], 5] and yields an improved quantitative bound as compared to the quasi-polynomial lower bound of 6] and the N-Omega(log log (N)) lower bound in the independent work of 7].

Complex potentials and singular integral equation for curve crack problem in antiplane elasticity

Four types of the fundamental complex potential in antiplane elasticity are introduced: (a) a point dislocation, (b) a concentrated force, (c) a dislocation doublet and (d) a concentrated force doublet. It is proven that if the axis of the concentrated force doublet is perpendicular to the direction of the dislocation doublet, the relevant complex potentials are equivalent. Using the obtained complex potentials, a singular integral equation for the curve crack problem is introduced. Some particular features of the obtained singular integral equation are discussed, and numerical solutions and examples are given.

Revelation of a Functional Dependence of the Sum of Two Uniaxial Strengths/Hardness on Elastic Work/Total Work of Indentation

Dimensional and finite element analyses were used to analyze the relationship between the mechanical properties and instrumented indentation response of materials. Results revealed the existence of a functional dependence of (engineering yield strength sigma(E,y) + engineering tensile strength sigma(E,b))/Oliver & Pharr hardness on the ratio of reversible elastic work to total work obtained from an indentation test. The relationship links up the Oliver & Pharr hardness with the material strengths, although the Oliver & Pharr hardness may deviate from the true hardness when sinking in or piling up occurs. The functional relationship can further be used to estimate the SUM sigma(E,y) + sigma(E,b) according to the data of an instrumented indentation test. The sigma(E,y) + sigma(E,b) value better reflects the strength of a material compared to the hardness value alone. The method was shown to be effective when applied to aluminum alloys. The relationship can further be used to estimate the fatigue limits, which are usually obtained from macroscopic fatigue tests in different modes.

Numerical estimate of the stability curve for the flow past a rotating cylinder

It is demonstrated that the primary instability of the wake of a two-dimensional circular cylinder rotating with constant angular velocity can be qualitatively well described by the Landau equation. The coefficients of the Landau equation are determined by means of numerical simulations for the Navier-Stokes equations. The critical Reynolds numbers, which depend on the angular velocity of the cylinder, are evaluated correctly by linear regression. (C) 2004 American Institute of Physics.

Local exponential divergence plot and optimal embedding of a chaotic time-series

we propose here a local exponential divergence plot which is capable of providing a new means of characterizing chaotic time series. The suggested plot defines a time dependent exponent LAMBDA and a ''plus'' exponent LAMBDA+ which serves as a criterion for estimating simultaneously the minimal acceptable embedding dimension, the proper delay time and the largest Lyapunov exponent.