29,608 research outputs found
Discrete-Continuous ADMM for Transductive Inference in Higher-Order MRFs
This paper introduces a novel algorithm for transductive inference in
higher-order MRFs, where the unary energies are parameterized by a variable
classifier. The considered task is posed as a joint optimization problem in the
continuous classifier parameters and the discrete label variables. In contrast
to prior approaches such as convex relaxations, we propose an advantageous
decoupling of the objective function into discrete and continuous subproblems
and a novel, efficient optimization method related to ADMM. This approach
preserves integrality of the discrete label variables and guarantees global
convergence to a critical point. We demonstrate the advantages of our approach
in several experiments including video object segmentation on the DAVIS data
set and interactive image segmentation
Cross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc
wireless networks. We first formulate the rate constraint and scheduling constraint using multicommodity flow variables, and formulate resource allocation in networks with fixed wireless channels (or single-rate wireless devices that can mask channel variations) as a utility maximization problem with these constraints.
By dual decomposition, the resource allocation problem
naturally decomposes into three subproblems: congestion control,
routing and scheduling that interact through congestion price.
The global convergence property of this algorithm is proved. We
next extend the dual algorithm to handle networks with timevarying
channels and adaptive multi-rate devices. The stability
of the resulting system is established, and its performance is
characterized with respect to an ideal reference system which
has the best feasible rate region at link layer.
We then generalize the aforementioned results to a general
model of queueing network served by a set of interdependent
parallel servers with time-varying service capabilities, which
models many design problems in communication networks. We
show that for a general convex optimization problem where a
subset of variables lie in a polytope and the rest in a convex set,
the dual-based algorithm remains stable and optimal when the
constraint set is modulated by an irreducible finite-state Markov
chain. This paper thus presents a step toward a systematic way
to carry out cross-layer design in the framework of “layering as
optimization decomposition” for time-varying channel models
Exploiting Amplitude Control in Intelligent Reflecting Surface Aided Wireless Communication with Imperfect CSI
Intelligent reflecting surface (IRS) is a promising new paradigm to achieve
high spectral and energy efficiency for future wireless networks by
reconfiguring the wireless signal propagation via passive reflection. To reap
the potential gains of IRS, channel state information (CSI) is essential,
whereas channel estimation errors are inevitable in practice due to limited
channel training resources. In this paper, in order to optimize the performance
of IRS-aided multiuser systems with imperfect CSI, we propose to jointly design
the active transmit precoding at the access point (AP) and passive reflection
coefficients of IRS, each consisting of not only the conventional phase shift
and also the newly exploited amplitude variation. First, the achievable rate of
each user is derived assuming a practical IRS channel estimation method, which
shows that the interference due to CSI errors is intricately related to the AP
transmit precoders, the channel training power and the IRS reflection
coefficients during both channel training and data transmission. Then, for the
single-user case, by combining the benefits of the penalty method, Dinkelbach
method and block successive upper-bound minimization (BSUM) method, a new
penalized Dinkelbach-BSUM algorithm is proposed to optimize the IRS reflection
coefficients for maximizing the achievable data transmission rate subjected to
CSI errors; while for the multiuser case, a new penalty dual decomposition
(PDD)-based algorithm is proposed to maximize the users' weighted sum-rate.
Simulation results are presented to validate the effectiveness of our proposed
algorithms as compared to benchmark schemes. In particular, useful insights are
drawn to characterize the effect of IRS reflection amplitude control
(with/without the conventional phase shift) on the system performance under
imperfect CSI.Comment: 15 pages, 10 figures, accepted by IEEE Transactions on Communication
Submodular relaxation for inference in Markov random fields
In this paper we address the problem of finding the most probable state of a
discrete Markov random field (MRF), also known as the MRF energy minimization
problem. The task is known to be NP-hard in general and its practical
importance motivates numerous approximate algorithms. We propose a submodular
relaxation approach (SMR) based on a Lagrangian relaxation of the initial
problem. Unlike the dual decomposition approach of Komodakis et al., 2011 SMR
does not decompose the graph structure of the initial problem but constructs a
submodular energy that is minimized within the Lagrangian relaxation. Our
approach is applicable to both pairwise and high-order MRFs and allows to take
into account global potentials of certain types. We study theoretical
properties of the proposed approach and evaluate it experimentally.Comment: This paper is accepted for publication in IEEE Transactions on
Pattern Analysis and Machine Intelligenc
A Novel Convex Relaxation for Non-Binary Discrete Tomography
We present a novel convex relaxation and a corresponding inference algorithm
for the non-binary discrete tomography problem, that is, reconstructing
discrete-valued images from few linear measurements. In contrast to state of
the art approaches that split the problem into a continuous reconstruction
problem for the linear measurement constraints and a discrete labeling problem
to enforce discrete-valued reconstructions, we propose a joint formulation that
addresses both problems simultaneously, resulting in a tighter convex
relaxation. For this purpose a constrained graphical model is set up and
evaluated using a novel relaxation optimized by dual decomposition. We evaluate
our approach experimentally and show superior solutions both mathematically
(tighter relaxation) and experimentally in comparison to previously proposed
relaxations
- …