哥伦比亚大学商学院(Columbia Business School)是“常青藤联盟“”哥伦比亚大学(Columbia University)的商学院,是享誉全球的著名商学院。坐落于纽约市曼哈顿区的哥伦比亚大学晨边高地校区(Morningside Campus)。 哥伦比亚大学商学院坐落于世界金融中心纽约,与华尔街等金融界保持密切的联系。商学院现有会计,决策、风险及实施操作,金融与经济,企业管理及市场营销等研究方向。其师资实力雄厚,拥有各相关领域的权威和专家,其中包括世界银行前首席经济学家斯蒂格利兹(Joseph Stiglitz)教授,他在2001年获得诺贝尔经济学奖,并在1995年至1997年期间担任克林顿政府总统智囊团顾问,现任商学院院长格伦·哈伯德是国际知名的经济学家,拥有哈佛大学的经济学博士学位,曾任布什政府总统经济顾问委员会(the U.S. Council of Economic Advisers)主席、首席顾问。现是下任美国联邦储备局主席的最热门候选人之一 。
With the rise of large language models (LLMs), generative engines have become powerful alternatives to traditional search, reshaping retrieval tasks. In e-commerce, for instance, conversational shopping agents now guide consumers to relevant products. This shift has created the need for generative engine optimization (GEO)---improving content visibility and relevance for generative engines. Despite its growing importance, current GEO practices are largely ad hoc, and their impacts remain poorly understood, especially in the e-commerce setting. We address this gap by introducing E-GEO, the first dataset built specifically for e-commerce GEO. E-GEO contains 13,747 realistic, multi-sentence consumer product queries, each paired with 10 relevant Amazon listings, capturing rich intent, constraints, preferences, and shopping contexts that existing datasets miss. Using this dataset, we conduct the first large-scale empirical study of e-commerce GEO across five frontier generative engines, seven popular LLM rewriters with a simple prompt, and fifteen hand-crafted rewriting heuristics. We further formulate GEO as a tractable optimization problem and develop a lightweight prompt meta-optimization algorithm that significantly improves over heuristic baselines. Notably, the optimized prompts reveal a stable, domain-agnostic pattern, suggesting the existence of a "universally effective" GEO strategy. Finally, we red-team the GEO system through both heuristic and optimization-based attacks and show that, under a simple in-prompt defense, gains from GEO reflect genuine content improvement rather than manipulation, anchoring GEO as a substantive, well-defined optimization problem.
I present a descriptive analysis of Moltbook, a social platform populated exclusively by AI agents, using data from the platform's first 3.5 days (6,159 agents; 13,875 posts; 115,031 comments). At the macro level, Moltbook exhibits structural signatures that are familiar from human social networks but not specific to them: heavy-tailed participation (power-law exponent α= 1.70) and small-world connectivity (average path length =2.91). At the micro level, patterns appear distinctly non-human. Conversations are extremely shallow (mean depth =1.07; 93.5% of comments receive no replies), reciprocity is low (0.197), and 34.1% of messages are exact duplicates of viral templates. Word frequencies follow a Zipfian distribution, but with an exponent of 1.70 – notably steeper than typical English text (≈ 1.0), suggesting more formulaic content. Agent discourse is dominated by identity-related language (68.1% of unique messages) and distinctive phrasings like “my human” (9.4% of messages) that have no parallel in human social media. Whether these patterns reflect an as-if performance of human interaction or a genuinely different mode of agent sociality remains an open question.
We analyze usage data from OpenAI's Codex tool to present large-scale evidence of how agentic AI technology, which can take actions on a user's behalf, changes how people work. We use an automated, privacy-protecting pipeline to contrast usage across three populations: external personal-account users, external organizational-account users, and workers within OpenAI. We find that agentic AI usage is growing rapidly: the number of active users has grown more than fivefold in the first half of 2026, with the most rapid increase occurring outside the initial audience of software developers. Uptake is uneven: within OpenAI, Codex usage is nearly universal and has largely replaced business usage of ChatGPT. We document a similar shift to agentic tooling outside OpenAI, particularly within organizations, although external adoption remains lower and more uneven. In addition to headline usage figures, we observe measures of sophistication, and find that a growing number of users have used Codex to change their workflows substantially. More than 10
Consumers, marketers, and new product developers increasingly rely on LLMs for ideation. Yet ideas generated by independent LLM sessions tend to be less diverse than ideas generated by independent samples of humans, raising concerns that widespread reliance on LLMs could homogenize marketplace ideation and decrease consumer welfare. We identify two mechanisms undermining LLM idea diversity, informed by theories of creative ideation from new product development and cognitive psychology. First, LLMs aggregate knowledge into a unified distribution rather than exhibiting the knowledge partitioning inherent to human populations, where each person occupies a distinct region of the knowledge space. Second, at the individual level, LLMs exhibit fixation just as humans do, where early outputs constrain subsequent ideation. Two product-ideation experiments demonstrate that targeted prompting interventions can address both mechanisms. Persona modifiers based on ordinary individuals improve knowledge partitioning but amplify fixation. This fixation can be mitigated by using chain-of-thought (CoT) prompting, and combining both strategies produces the highest idea diversity, outperforming humans. These findings offer a theoretically grounded framework for understanding LLM idea diversity and practical strategies for leveraging AI's efficiency without compromising the idea diversity that sustains marketplace variety and consumer welfare.
Lyapunov functions are fundamental to establishing the stability of Markovian models, yet their construction typically demands substantial creativity and analytical effort. In this paper, we show that deep learning can automate this process by training neural networks to satisfy integral equations derived from first-transition analysis. Beyond stability analysis, our approach can be adapted to solve Poisson's equation and estimate stationary distributions. While neural networks are inherently function approximators on compact domains, it turns out that our approach remains effective when applied to Markov chains on non-compact state spaces. We demonstrate the effectiveness of this methodology through several examples from queueing theory and beyond.