Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.0705

Optimal Solutions for Sparse Principal Component Analysis

Alexandre d'Aspremont·Francis Bach·Laurent El Ghaoui
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This is known as sparse principal component analysis and has a wide array of applications in machine learning and engineering. We formulate a new semidefinite relaxation to this problem and derive a greedy algorithm that computes a full set of good solutions for all target numbers of non zero coefficients, with total complexity O(n^3), where n is the number of variables. We then use the same relaxation to derive sufficient conditions for global optimality of a solution, which can be tested in O(n^3) per pattern. We discuss applications in subset selection and sparse recovery and show on artificial examples and biological data that our algorithm does provide globally optimal solutions in many cases.

Explore related subjects

cs.AIcs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandre d'Aspremont, Francis Bach, Laurent El Ghaoui. 2007-11-09. Optimal Solutions for Sparse Principal Component Analysis. https://arxiv.org/abs/0707.0705

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Anchoring Distributed Agency: Institutional Metaphors for Designing Large-Scale AI and AI Techniques for Running Institutions

Artificial Intelligence (AI) started out with the ambition to reproduce the human mind, but as soon as the sheer scale of that ambition became apparent, it retreated into either studying specialized intelligent behaviours or proposing overarching architectural concepts for interfacing specialized intelligent components---conceived of as agents acting through organizational structures. The agent-based modelling paradigm proved to have interesting applications beyond the original domain, supporting the understanding, simulation, and the assessment of behaviour of socio-economic and legal structures on an aggregate level. Looking at contemporary AI, whereas text completion provides a successful example of specialized behaviour, surprisingly little of the rich foundation of multi-agent systems (MAS) and normative systems research is currently reflected in Agentic AI systems. Addressing this gap, the chapter examines cross-cutting conceptualisations, modelling problems, and design challenges shared by large-scale distributed AI and institutional systems. Three main contributions can be highlighted. First, by tracing the historical trajectory of AI, the chapter identifies an \textit{ecological} perspective on intelligence, examining both the value and limits of the \textit{compression-as-intelligence} hypothesis. Second, it shows how moving between internal cognitive mechanisms and external manifestations of agency supports a functional separation of concerns for both individual and collective agency. Third, it argues that \textit{epistemological}, \textit{normative}, and \textit{value pluralisms} are necessary conditions for sustaining the ecological character of intelligence. Furthermore, we indicate how AI techniques can support institutions by modelling social roles, simulating normative interactions, detecting and diagnosing failures, and supporting procedures of review and revision.

cs.AI↗
arXiv2026

Risk-Aware Alignment Must Incorporate Reward Uncertainty

We consider the problem of policy optimization with noisy rewards, where the policy is constrained to be in the neighborhood of a reference policy.We study the risk of the policy optimization process, defined to be the chance of obtaining a policy worse off than the reference policy. In an idealized multivariate Gaussian model for the noisy reward function, we show that the regularizer achieving optimal risk in a suitably local neighborhood of the reference policy is the quadratic norm weighted by the reward covariance matrix. This result is used to develop a new policy optimization algorithm based on regularization via reward variance estimates. Experiments across synthetic bandit models, large language models and reward models show that this algorithm yields more robust alignment outcomes than existing approaches.

cs.AI↗
arXiv2026

Agent-Environment Alignment via Automated Interface Generation

Large language model (LLM) agents have shown impressive reasoning capabilities in interactive decision-making tasks. These agents interact with environment through intermediate interfaces, such as predefined action spaces and interaction rules, which mediate the perception and action. However, mismatches often happen between the internal expectations of the agent regarding the influence of its issued actions and the actual state transitions in the environment, a phenomenon referred to as agent-environment misalignment. While prior work has invested substantially in improving agent strategies and environment design, the critical role of the interface still remains underexplored. In this work, we empirically demonstrate that agent-environment misalignment poses a significant bottleneck to agent performance. To mitigate this issue, we propose ALIGN, an Auto-Aligned Interface Generation framework that alleviates the misalignment by enriching the interface. Specifically, the ALIGN-generated interface enhances both the static information of the environment and the step-wise observations returned to the agent. Implemented as a lightweight wrapper, this interface achieves the alignment without modifying either the agent logic or the environment code. Experiments across multiple domains including embodied tasks, web navigation and tool-use, show consistent performance improvements, with up to a 45.67% success rate improvement observed in ALFWorld. Meanwhile, ALIGN-generated interface can generalize across different agent architectures and LLM backbones without interface regeneration. Code and experimental results are available at https://github.com/THUNLP-MT/ALIGN.

cs.AI↗