Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

3570104139 · Jun 202019922001200920172026
48 results for Sum-rate maximization

A deep neural network (DNN) based power control method is proposed, which aims at solving the non-convex optimization problem of maximizing the sum rate of a multi-user interference channel. Towards this end, we first present PCNet, which is a multi-layer fully connected neural network that is specifically designed for…

2018-07-26abs ↗pdf ↗

This paper studies communication efficiency in federated learning by optimizing the sum-rate-distortion function for indirect multiterminal source coding.

problem Indirect multiterminal source coding in federated learning where edge devices send noisy gradients to the server.
method Analyzes the rate region for the quadratic vector Gaussian CEO problem under unbiased estimator and derives an explicit formula for the sum-rate-distortion function.
result Derives an explicit formula for the sum-rate-distortion function in the special case of identical gradients over edge devices.

Graph neural network optimizes energy-efficient precoding for massive MIMO systems.

problem Energy bottleneck in massive MIMO systems due to high DAC complexity and power consumption.
method Proposes a graph neural network to directly output precoded quantized vectors from channel matrix and transmit symbols.
result Significant increase in achievable sum rate with reduced DAC power consumption.

Deep actor-critic learning optimizes power control in mobile networks.

problem Optimizing power control in large-scale wireless mobile networks.
method Multi-agent deep reinforcement learning with deep deterministic policy gradient.
result The algorithm maximizes a global utility function in a distributed manner.

Paper studies fundamental limits of communication in distributed learning.

problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.

Study finds Hilbert square of real surfaces can be maximal even when the surface has disconnected real locus.

problem Exploring conditions for maximality of Hilbert square of real surfaces.
method Analyzing Hilbert square of maximal real surfaces and examining specific examples.
result Hilbert square can be maximal even for surfaces with disconnected real locus.

Study examines maximal domains of radial harmonic functions across different curvature types.

problem Understanding maximal domains of radial harmonic functions in various curvature settings.
method Analysis of harmonic spaces with positive, zero, and negative curvature.
result Characterization of maximal domains for radial harmonic functions in different curvature contexts.

We shall investigate maximal surfaces in Minkowski 3-space with singularities. Although the plane is the only complete maximal surface without singular points, there are many other complete maximal surfaces with singularities and we show that they satisfy an Osserman-type inequality.

2003-07-23abs ↗pdf ↗

The study finds that maximizing median returns is the only viable strategy in portfolio selection.

problem Difficulties in studying optimal portfolio strategies due to discontinuity and time inconsistency in maximizing median and quantile returns.
method Used intra-personal equilibrium approach to analyze portfolio selection under median and quantile maximization.
result Median maximization is the only viable strategy, with no investment in risky assets for other quantiles.

Study of large group actions on surfaces, focusing on Hurwitz and handlebody groups.

problem Characterizing and understanding group actions on surfaces, especially maximal handlebody and Hurwitz groups.
method Analyzing various group actions, comparing Hurwitz and handlebody groups, and examining bounding actions.
result Relationship between Hurwitz groups and maximal handlebody groups, and insights into geometric bounding actions.

We study homologically maximizing timelike geodesics in conformally flat tori. A causal geodesic γγ in such a torus is said to be homologically maximizing if one (hence every) lift of γγ to the universal cover is arclength maximizing. First we prove a compactness result for homologically maximizing timelike geodesics…

2010-03-11abs ↗pdf ↗

New guarantees for adaptive combinatorial maximization with various objectives.

problem Maximizing under cardinality constraints and minimum cost coverage in adaptive settings.
method Bayesian approach with comprehensive approximation guarantees for various utility functions.
result Maximal gain ratio is a new parameter that provides stronger approximation guarantees than greedy policies.

Fast algorithms developed for adaptive and fully adaptive submodular maximization problems.

problem Maximizing submodular functions subject to constraints in linear time.
method Developed linear-time algorithms for two submodular maximization problems: adaptive and fully adaptive.
result Achieved (11/eε)(1-1/e-ε) approximation ratio for adaptive submodular maximization and $ rac{1-1/e-ε}{4-2/e-2ε}$ for fully adaptive submodular maximization.

We show that a positive braid knot has maximal topological 4-genus exactly if it has maximal signature invariant. As an application, we determine all positive braid knots with maximal topological 4-genus and compute the topological 4-genus for all positive braid knots with up to 12 crossings.

2015-11-12abs ↗pdf ↗

The geometry and topology of complete nonorientable maximal surfaces with lightlike singularities in the Lorentz-Minkowski 3-space are studied. Some topological congruence formulae for surfaces of this kind are obtained. As a consequence, some existence and uniqueness results for maximal Moebius strips and maximal Klei…

2009-05-13abs ↗pdf ↗

Differentially private algorithms for submodular maximization under various constraints.

problem Maximizing decomposable submodular functions under constraints while preserving privacy.
method Designing differentially private algorithms for both monotone and non-monotone decomposable submodular maximization under general matroid constraints.
result Improved utility guarantees and competitive performance compared to non-private algorithms.

Maximal and Borel Anosov representations in Sp(4,R)Sp(4,\mathbb{R}) are proven to be Hitchin.

problem Characterizing representations of surface groups into Sp(4,R)Sp(4,\mathbb{R}) that are Borel Anosov and maximal.
method Proving representations are Hitchin if they have maximal Toledo invariant and are Borel Anosov.
result Maximal and Borel Anosov representations in Sp(4,R)Sp(4,\mathbb{R}) are Hitchin.

The study finds a metric that maximizes the second eigenvalue of the Conformal Laplacian.

problem Maximizing the second eigenvalue of the Conformal Laplacian over conformal metrics.
method Analyzes properties of the Conformal Laplacian and constructs metrics to maximize eigenvalues.
result Existence of a metric that maximizes the second eigenvalue of the Conformal Laplacian.

As in the case of minimal surfaces in the Euclidean 3-space, the reflection principle for maximal surfaces in the Lorentz-Minkowski 3-space asserts that if a maximal surface has a spacelike line segment LL, the surface is invariant under the 180180^\circ-rotation with respect to LL. However, such a reflection property…

2020-02-19abs ↗pdf ↗

The ultimate goal of a supervised learning algorithm is to produce models constructed on the training data that can generalize well to new examples. In classification, functional margin maximization -- correctly classifying as many training examples as possible with maximal confidence --has been known to construct mode…

2020-01-28abs ↗pdf ↗

Local equivalence found between maximally symmetric rolling and flat Cartan distributions.

problem Establishing local equivalence between maximally symmetric rolling and flat Cartan distributions.
method Using complex parametrisation of su(2), a change of coordinates maps the maximally symmetric rolling (2,3,5)(2,3,5)-distribution to the flat Cartan distribution.
result Local equivalence between maximally symmetric rolling and flat Cartan distributions established.

This paper improves tail dependence analysis by introducing a path-based approach.

problem The classical tail dependence coefficient fails to capture non-exchangeable features of tail dependence.
method The paper introduces a path-based maximal tail dependence approach to capture the most pronounced feature of dependence over all possible paths.
result The paper proves the existence and provides an explicit characterization of the path-based maximal TDC, improving analytical and computational tractability.