Search: convex - ai.jp.net

Research #Deep Learning Architecture 📝 BlogAnalyzed: Jan 3, 2026 06:31

DeepSeek's mHC: Improving Residual Connections

Published:Jan 2, 2026 15:44

•

1 min read

•

r/LocalLLaMA

Analysis

The article highlights DeepSeek's innovation in addressing the limitations of the standard residual connection in deep learning models. By introducing Manifold-Constrained Hyper-Connections (mHC), DeepSeek tackles the instability issues associated with previous attempts to make residual connections more flexible. The core of their solution lies in constraining the learnable matrices to be double stochastic, ensuring signal stability and preventing gradient explosion. The results demonstrate significant improvements in stability and performance compared to baseline models.

Key Takeaways

•DeepSeek's mHC improves residual connections by introducing a more flexible and stable approach.
•The core innovation is using double stochastic constraints on learnable matrices to prevent gradient explosion.
•mHC demonstrates significant improvements in stability and performance compared to standard baselines.

Reference

“DeepSeek solved the instability by constraining the learnable matrices to be "Double Stochastic" (all elements ≧ 0, rows/cols sum to 1). Mathematically, this forces the operation to act as a weighted average (convex combination). It guarantees that signals are never amplified beyond control, regardless of network depth.”

Permalink r/LocalLLaMA

Research Paper #Wireless Communication, ISAC, Resource Allocation 🔬 ResearchAnalyzed: Jan 3, 2026 17:07

Efficient Resource Allocation for Wireless Powered ISAC

Published:Dec 31, 2025 12:03

•

1 min read

•

ArXiv

Analysis

This paper addresses the critical challenge of balancing energy supply, communication throughput, and sensing accuracy in wireless powered integrated sensing and communication (ISAC) systems. It focuses on target localization, a key application of ISAC. The authors formulate a max-min throughput maximization problem and propose an efficient successive convex approximation (SCA)-based iterative algorithm to solve it. The significance lies in the joint optimization of WPT duration, ISAC transmission time, and transmit power, demonstrating performance gains over benchmark schemes. This work contributes to the practical implementation of ISAC by providing a solution for resource allocation under realistic constraints.

Key Takeaways

•Addresses the resource allocation problem in wireless powered ISAC systems.
•Focuses on target localization and its impact on performance.
•Proposes an efficient SCA-based algorithm for joint optimization.
•Demonstrates performance gains over benchmark schemes.
•Contributes to the practical implementation of ISAC.

Reference

“The paper highlights the importance of coordinated time-power optimization in balancing sensing accuracy and communication performance in wireless powered ISAC systems.”

Permalink ArXiv

Research Paper #Wireless Communication, Reinforcement Learning, UAV, RIS 🔬 ResearchAnalyzed: Jan 3, 2026 08:42

Throughput Optimization in UAV-Mounted RIS using DRL

Published:Dec 31, 2025 10:36

•

1 min read

•

ArXiv

Analysis

This paper addresses a practical problem in wireless communication: optimizing throughput in a UAV-mounted Reconfigurable Intelligent Surface (RIS) system, considering real-world impairments like UAV jitter and imperfect channel state information (CSI). The use of Deep Reinforcement Learning (DRL) is a key innovation, offering a model-free approach to solve a complex, stochastic, and non-convex optimization problem. The paper's significance lies in its potential to improve the performance of UAV-RIS systems in challenging environments, while also demonstrating the efficiency of DRL-based solutions compared to traditional optimization methods.

Key Takeaways

•Proposes a DRL-based solution for throughput optimization in UAV-mounted RIS systems.
•Addresses practical impairments like UAV jitter and imperfect CSI.
•Achieves higher throughput than conventional methods under severe jitter and low CSI quality.
•Offers significantly faster inference times compared to traditional optimization methods.

Reference

“The proposed DRL controllers achieve online inference times of 0.6 ms per decision versus roughly 370-550 ms for AO-WMMSE solvers.”

Permalink ArXiv

Research Paper #Optimization, Multiobjective Optimization, Non-convex Optimization, Algorithms 🔬 ResearchAnalyzed: Jan 3, 2026 08:46

Proximal Subgradient Algorithm for Constrained Multiobjective DC-type Optimization

Published:Dec 31, 2025 08:31

•

1 min read

•

ArXiv

Analysis

This paper addresses a challenging class of multiobjective optimization problems involving non-smooth and non-convex objective functions. The authors propose a proximal subgradient algorithm and prove its convergence to stationary solutions under mild assumptions. This is significant because it provides a practical method for solving a complex class of optimization problems that arise in various applications.

Key Takeaways

•Addresses constrained multiobjective optimization with DC-type functions.
•Proposes a proximal subgradient algorithm.
•Proves convergence to stationary solutions under mild assumptions.
•Provides a theoretical foundation and a practical algorithm for a complex optimization problem.

Reference

“Under mild assumptions, the sequence generated by the proposed algorithm is bounded and each of its cluster points is a stationary solution.”

Permalink ArXiv

Research Paper #Optimization, Graph Neural Networks, Distributed Systems 🔬 ResearchAnalyzed: Jan 3, 2026 17:09

Decentralized Optimization for Graph-Structured Nonlinear Programs

Published:Dec 31, 2025 07:05

•

1 min read

•

ArXiv

Analysis

This paper introduces MP-Jacobi, a novel decentralized framework for solving nonlinear programs defined on graphs or hypergraphs. The approach combines message passing with Jacobi block updates, enabling parallel updates and single-hop communication. The paper's significance lies in its ability to handle complex optimization problems in a distributed manner, potentially improving scalability and efficiency. The convergence guarantees and explicit rates for strongly convex objectives are particularly valuable, providing insights into the method's performance and guiding the design of efficient clustering strategies. The development of surrogate methods and hypergraph extensions further enhances the practicality of the approach.

Key Takeaways

•Proposes MP-Jacobi, a decentralized framework for graph-structured nonlinear programs.
•Combines message passing and Jacobi block updates for parallel updates and single-hop communication.
•Provides convergence guarantees and explicit rates for strongly convex objectives.
•Develops surrogate methods to reduce computational complexity.
•Extends the method to hypergraphs.

Reference

“MP-Jacobi couples min-sum message passing with Jacobi block updates, enabling parallel updates and single-hop communication.”

Permalink ArXiv

Research Paper #Reinforcement Learning, Risk-Sensitive RL, Bayesian Optimization 🔬 ResearchAnalyzed: Jan 3, 2026 16:41

Robust Risk-Sensitive RL with Bayesian DP

Published:Dec 31, 2025 03:13

•

1 min read

•

ArXiv

Analysis

This paper introduces a novel framework for risk-sensitive reinforcement learning (RSRL) that is robust to transition uncertainty. It unifies and generalizes existing RL frameworks by allowing general coherent risk measures. The Bayesian Dynamic Programming (Bayesian DP) algorithm, combining Monte Carlo sampling and convex optimization, is a key contribution, with proven consistency guarantees. The paper's strength lies in its theoretical foundation, algorithm development, and empirical validation, particularly in option hedging.

Key Takeaways

•Proposes a novel RSRL framework robust to transition uncertainty.
•Unifies and generalizes existing RL frameworks.
•Develops a Bayesian DP algorithm with strong consistency guarantees.
•Demonstrates advantages in risk-sensitivity and robustness.
•Validates the approach through numerical experiments, including option hedging.

Reference

“The Bayesian DP algorithm alternates between posterior updates and value iteration, employing an estimator for the risk-based Bellman operator that combines Monte Carlo sampling with convex optimization.”

Permalink ArXiv

Research Paper #Geometric Analysis, Mean Curvature Flow 🔬 ResearchAnalyzed: Jan 3, 2026 09:23

Mean Convex Neighborhood Conjecture Resolved for Cylindrical Flows

Published:Dec 31, 2025 00:12

•

1 min read

•

ArXiv

Analysis

This paper provides a complete classification of ancient, asymptotically cylindrical mean curvature flows, resolving the Mean Convex Neighborhood Conjecture. The results have implications for understanding the behavior of these flows near singularities, offering a deeper understanding of geometric evolution equations. The paper's independence from prior work and self-contained nature make it a significant contribution to the field.

Key Takeaways

•Resolves the Mean Convex Neighborhood Conjecture for mean curvature flows with cylindrical singularities.
•Provides a complete classification of ancient, asymptotically cylindrical flows.
•Establishes a canonical neighborhood theorem near cylindrical singularities.
•Offers a new proof of the existence of flying wing solitons.

Reference

“The paper proves that any ancient, asymptotically cylindrical flow is non-collapsed, convex, rotationally symmetric, and belongs to one of three canonical families: ancient ovals, the bowl soliton, or the flying wing translating solitons.”

Permalink ArXiv

Research Paper #Quantum Chemistry, Optimization 🔬 ResearchAnalyzed: Jan 3, 2026 09:24

Derivative-Free Optimization for Quantum Chemistry

Published:Dec 30, 2025 23:15

•

1 min read

•

ArXiv

Analysis

This paper investigates the application of derivative-free optimization algorithms to minimize Hartree-Fock-Roothaan energy functionals, a crucial problem in quantum chemistry. The study's significance lies in its exploration of methods that don't require analytic derivatives, which are often unavailable for complex orbital types. The use of noninteger Slater-type orbitals and the focus on challenging atomic configurations (He, Be) highlight the practical relevance of the research. The benchmarking against the Powell singular function adds rigor to the evaluation.

Key Takeaways

•Evaluates derivative-free optimization algorithms for quantum chemistry problems.
•Focuses on Hartree-Fock-Roothaan energy functionals with noninteger Slater-type orbitals.
•Compares Powell's method, Nelder-Mead, pattern search, and a model-based algorithm.
•Applies algorithms to He and Be isoelectronic series.
•Addresses the challenge of non-convex optimization landscapes.

Reference

“The study focuses on atomic calculations employing noninteger Slater-type orbitals. Analytic derivatives of the energy functional are not readily available for these orbitals.”

Permalink ArXiv

Paper #Machine Learning, Statistics 🔬 ResearchAnalyzed: Jan 3, 2026 09:27

Robust Reduced Rank Regression for Heavy-Tailed Noise and Missing Data

Published:Dec 30, 2025 20:09

•

1 min read

•

ArXiv

Analysis

This paper addresses the limitations of classical Reduced Rank Regression (RRR) methods, which are sensitive to heavy-tailed errors, outliers, and missing data. It proposes a robust RRR framework using Huber loss and non-convex spectral regularization (MCP and SCAD) to improve accuracy in challenging data scenarios. The method's ability to handle missing data without imputation and its superior performance compared to existing methods make it a valuable contribution.

Key Takeaways

•Proposes a robust RRR framework to handle heavy-tailed noise, outliers, and missing data.
•Combines Huber loss with non-convex spectral regularization (MCP and SCAD).
•Handles missing data without imputation.
•Outperforms existing methods in simulations and real-world data.
•Provides an R package (rrpackrobust) for implementation.

Reference

“The proposed methods substantially outperform nuclear-norm-based and non-robust alternatives under heavy-tailed noise and contamination.”

Permalink ArXiv

Research Paper #Federated Learning, Wireless Networks, Data Heterogeneity 🔬 ResearchAnalyzed: Jan 3, 2026 15:41

Data Heterogeneity-Aware Client Selection for Federated Learning

Published:Dec 30, 2025 15:21

•

1 min read

•

ArXiv

Analysis

This paper addresses a critical challenge in Federated Learning (FL): data heterogeneity among clients in wireless networks. It provides a theoretical analysis of how this heterogeneity impacts model generalization, leading to inefficiencies. The proposed solution, a joint client selection and resource allocation (CSRA) approach, aims to mitigate these issues by optimizing for reduced latency, energy consumption, and improved accuracy. The paper's significance lies in its focus on practical constraints of FL in wireless environments and its development of a concrete solution to address data heterogeneity.

Key Takeaways

•Addresses the problem of data heterogeneity in Federated Learning within wireless networks.
•Provides a theoretical analysis of the impact of data heterogeneity on model generalization error.
•Proposes a joint client selection and resource allocation (CSRA) approach to optimize for latency, energy consumption, and accuracy.
•Demonstrates improved performance compared to baseline methods through simulations.

Reference

“The paper proposes a joint client selection and resource allocation (CSRA) approach, employing a series of convex optimization and relaxation techniques.”

Permalink ArXiv

Research Paper #Computational Geometry, SAT Solving 🔬 ResearchAnalyzed: Jan 3, 2026 16:50

Notes on the 33-point Erdős--Szekeres Problem

Published:Dec 30, 2025 08:10

•

1 min read

•

ArXiv

Analysis

This paper addresses the open problem of determining ES(7) in the Erdős--Szekeres problem, a classic problem in computational geometry. It's significant because it tackles a specific, unsolved case of a well-known conjecture. The use of SAT encoding and constraint satisfaction techniques is a common approach for tackling combinatorial problems, and the paper's contribution lies in its specific encoding and the insights gained from its application to this particular problem. The reported runtime variability and heavy-tailed behavior highlight the computational challenges and potential areas for improvement in the encoding.

Key Takeaways

•Applies SAT encoding to the 33-point Erdős--Szekeres problem.
•Uses triple-orientation variables and a 4-set convexity criterion.
•Reports UNSAT certificates for anchored subfamilies.
•Highlights runtime variability and heavy-tailed behavior, indicating computational challenges.

Reference

“The framework yields UNSAT certificates for a collection of anchored subfamilies. We also report pronounced runtime variability across configurations, including heavy-tailed behavior that currently dominates the computational effort and motivates further encoding refinements.”

Permalink ArXiv

Research Paper #Computational Geometry, Quasi-Monte Carlo Methods, Sampling 🔬 ResearchAnalyzed: Jan 3, 2026 18:59

New Partition Method Improves Star Discrepancy

Published:Dec 29, 2025 09:39

•

1 min read

•

ArXiv

Analysis

This paper introduces a new method for partitioning space that leads to point sets with lower expected star discrepancy compared to existing methods like jittered sampling. This is significant because lower star discrepancy implies better uniformity and potentially improved performance in applications like numerical integration and quasi-Monte Carlo methods. The paper also provides improved upper bounds for the expected star discrepancy.

Key Takeaways

•Introduces a new class of convex equivolume partition models.
•Demonstrates that the new partition method yields lower expected star discrepancy than jittered sampling.
•Provides improved upper bounds for the expected star discrepancy.
•Resolves an open question regarding the strong partition principle for star discrepancy.

Reference

“The paper proves that the new partition sampling method yields stratified sampling point sets with lower expected star discrepancy than both classical jittered sampling and simple random sampling.”

Permalink ArXiv

Research #Optimization Algorithms 🔬 ResearchAnalyzed: Jan 4, 2026 06:49

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis

Published:Dec 29, 2025 03:35

•

1 min read

•

ArXiv

Analysis

The article presents a refined analysis of clipped gradient methods for nonsmooth convex optimization in the presence of heavy-tailed noise. This suggests a focus on theoretical advancements in optimization algorithms, particularly those dealing with noisy data and non-differentiable functions. The use of "refined analysis" implies an improvement or extension of existing understanding.

Key Takeaways

•Focus on optimization algorithms.
•Addresses heavy-tailed noise.
•Deals with non-differentiable functions.
•Presents a refined analysis, suggesting improvements over existing methods.

Reference

“”

Permalink ArXiv

Research Paper #Control Systems, Machine Learning, Optimization 🔬 ResearchAnalyzed: Jan 3, 2026 19:08

Data-Driven Economic Predictive Control for Nonlinear Systems

Published:Dec 29, 2025 03:25

•

1 min read

•

ArXiv

Analysis

This paper presents a novel data-driven control approach for optimizing economic performance in nonlinear systems, addressing the challenges of nonlinearity and constraints. The use of neural networks for lifting and convex optimization for control is a promising combination. The application to industrial case studies strengthens the practical relevance of the work.

Key Takeaways

•Proposes a data-enabled economic predictive control method for nonlinear systems.
•Uses neural networks for lifting to approximate nonlinearities.
•Formulates the control problem as a convex optimization problem.
•Demonstrates effectiveness through industrial case studies (water treatment, carbon capture).

Reference

“The online control problem is formulated as a convex optimization problem, despite the nonlinearity of the system dynamics and the original economic cost function.”

Permalink ArXiv

Research Paper #Compressed Sensing, Sparse Recovery, Optimization, Image Reconstruction 🔬 ResearchAnalyzed: Jan 3, 2026 19:10

DCEN for Compressed Sensing

Published:Dec 29, 2025 01:35

•

1 min read

•

ArXiv

Analysis

This paper introduces a novel framework, DCEN, for sparse recovery, particularly beneficial for high-dimensional variable selection with correlated features. It unifies existing models, provides theoretical guarantees for recovery, and offers efficient algorithms. The extension to image reconstruction (DCEN-TV) further enhances its applicability. The consistent outperformance over existing methods in various experiments highlights its significance.

Key Takeaways

•Proposes a new framework, DCEN, for sparse recovery.
•DCEN unifies existing models like Lasso and Elastic Net.
•Provides theoretical guarantees for recovery under RIP.
•Offers efficient optimization algorithms (DCA, ADMM).
•Demonstrates superior performance in various applications, including MRI image reconstruction.

Reference

“DCEN consistently outperforms state-of-the-art methods in sparse signal recovery, high-dimensional variable selection under strong collinearity, and Magnetic Resonance Imaging (MRI) image reconstruction, achieving superior recovery accuracy and robustness.”

Permalink ArXiv

Research Paper #Power Systems, Optimization, Convex Optimization 🔬 ResearchAnalyzed: Jan 3, 2026 16:17

Bezier Curve Convexification for AC Optimal Power Flow

Published:Dec 28, 2025 15:18

•

1 min read

•

ArXiv

Analysis

This paper addresses the computationally challenging AC Optimal Power Flow (ACOPF) problem, a fundamental task in power systems. The authors propose a novel convex reformulation using Bezier curves to approximate nonlinear terms. This approach aims to improve computational efficiency and reliability, particularly for weak power systems. The paper's significance lies in its potential to provide a more accessible and efficient tool for power system planning and operation, validated by its performance on the IEEE 118 bus system.

Key Takeaways

•Proposes a convex reformulation of the ACOPF problem using Bezier curves.
•Aims to improve computational efficiency and reliability for weak power systems.
•Achieves high accuracy on the IEEE 118 bus system.
•Offers a transparent and easily implementable solution for researchers and operators.

Reference

“The proposed model achieves convergence on large test systems (e.g., IEEE 118 bus) in seconds and is validated against exact AC solutions.”

Permalink ArXiv

research #optimization algorithms 🔬 ResearchAnalyzed: Jan 4, 2026 06:50

First-order method for nonconvex-strongly-concave constrained minimax optimization

Published:Dec 28, 2025 12:31

•

1 min read

•

ArXiv

Analysis

The article announces a new research paper on a specific optimization problem. The focus is on developing a first-order method, which is computationally efficient, for solving a minimax optimization problem with specific constraints (nonconvex-strongly-concave). This suggests a contribution to the field of optimization algorithms, potentially improving the efficiency or applicability of solving such problems.

Key Takeaways

•The research focuses on a specific type of optimization problem (minimax with nonconvex-strongly-concave constraints).
•The proposed method is a first-order method, implying computational efficiency.
•The research aims to improve the efficiency or applicability of solving this type of optimization problem.

Reference

“”

Permalink ArXiv

Paper #Machine Learning, Statistics, Optimization 🔬 ResearchAnalyzed: Jan 3, 2026 19:42

Polynomial-Time Algorithms for Near-Optimal Estimation with Convex Constraints

Published:Dec 27, 2025 22:06

•

1 min read

•

ArXiv

Analysis

This paper addresses the problem of estimating parameters in statistical models under convex constraints, a common scenario in machine learning and statistics. The key contribution is the development of polynomial-time algorithms that achieve near-optimal performance (in terms of minimax risk) under these constraints. This is significant because it bridges the gap between statistical optimality and computational efficiency, which is often a trade-off. The paper's focus on type-2 convex bodies and its extensions to linear regression and robust heavy-tailed settings broaden its applicability. The use of well-balanced conditions and Minkowski gauge access suggests a practical approach, although the specific assumptions need to be carefully considered.

Reference

“”

Permalink ArXiv

Infrastructure #Transportation 🔬 ResearchAnalyzed: Jan 10, 2026 08:26

Convexity in Multi-Commodity Freeway Control: A Deep Dive

Published:Dec 22, 2025 19:34

•

1 min read

•

ArXiv

Analysis

The ArXiv article likely investigates the mathematical properties of freeway network control, specifically focusing on convexity to optimize traffic flow. Understanding convexity is crucial for developing efficient algorithms to manage complex transportation systems.

Key Takeaways

•The research likely explores the application of optimization techniques.
•The work probably aims to improve traffic management efficiency.
•Understanding the mathematical properties is key to algorithmic development.

Reference

“The article's core focus is on analyzing the convexity of freeway network control strategies.”

Permalink ArXiv

Research #llm 🔬 ResearchAnalyzed: Jan 4, 2026 07:34

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage

Published:Dec 22, 2025 08:41

•

1 min read

•

ArXiv

Analysis

This article presents research on a convex loss function designed for set prediction. The focus is on achieving an optimal balance between the size of the predicted sets and their conditional coverage, which is a crucial aspect of many prediction tasks. The use of a convex loss function suggests potential benefits in terms of computational efficiency and guaranteed convergence during training. The research likely explores the theoretical properties of the proposed loss function and evaluates its performance on various set prediction benchmarks.

Reference

“”

Permalink Hacker News