Papers for

marketing analytics teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Audience tailoring improves privacy and utility in text data sharing

Who's Asking? Audience-Conditioned Privatization

Abstract: The abundance of user-generated conversational data makes the question of how to responsibly derive insights from confidential data without putting the individuals in it at risk ever more important. However, the majority of existing differentially private (DP) synthetic text generation (SDG) and anonymization approaches ignore the context of the data's downstream usage, which results in loss of important information. DP-SDG provides the same guarantee regardless of the recipient, and anonymization relies on predefined attribute categories. They both ignore the observation that an attribute that is harmless to one audience can be sensitive to another, and each audience typically needs only some attributes preserved. We propose Ext-Classify-Priv, a framework that (1) extracts the information types present in a corpus, (2) classifies which of them are private for a given audience following contextual integrity, and (3) protects only those attributes, using either anonymization or SDG with Feature-DP approaches. On Reddit data with 3 audiences, our audience-specific releases are more faithful than a single audience-agnostic release for every audience. On bioRxiv data, our SDG method improves MAUVE from 0.097 to 0.420 at epsilon=1 and on the proprietary real estate data, our anonymization method improves MAUVE from 0.698 to 0.959 over the best baselines.

Fri 6 NovCryptography and SecurityArtificial IntelligenceMachine Learning
The gist
Sharing text data safely is tricky because what counts as sensitive information depends on who sees it. The authors offer a new way to identify which parts of text are private for different audiences and then protect only those parts. This approach keeps more useful information intact compared to standard methods that treat all data the same. Their method works better on Reddit, scientific articles, and real estate data by balancing privacy with data usefulness.
Open → 2611.08884v1

Preprocessing choices affect utility and fairness in llm recommendations

Preprocessing Choices in Fine-Tuning Data Matter: Utility and Demographic Sensitivity in LLM-Based Recommendation

Abstract: Large language models (LLMs) have introduced a generative approach to recommendation, producing item lists from textual representations of user histories and item information. However, this generative setting raises challenges concerning output validity, prompt consistency, and sensitivity to demographic descriptors. In this work, we investigate how preprocessing choices in fine-tuning data affect recommendation utility and fairness-related behavior in a generative LLM-based recommender system. We first establish a controlled recommendation pipeline that combines supervised fine-tuning, catalog-constrained decoding, and prompt augmentation. We then study three preprocessing choices: item-title representation, demographic balancing, and auxiliary item-knowledge enrichment. Experiments on MovieLens-1M show that the catalog-constrained pipeline eliminates out-of-catalog items and ensures complete ten-item outputs, while prompt augmentation improves prompt consistency and utility. Original MovieLens titles increase HR@10 from 10.67% to 12.47% and Coverage@10 from 41.36% to 47.88%. Fairness-related effects are attribute-dependent: age balancing and knowledge enrichment reduce selected group-level utility gaps while largely preserving utility, whereas gender balancing reduces utility without improving the evaluated gender-related indicators. Overall, preprocessing choices in fine-tuning data should be evaluated jointly in terms of utility, output behavior, and demographic sensitivity.

Mon 2 NovInformation RetrievalComputation and LanguageMachine Learning
The gist
Large language models can recommend items by generating lists from what they learn about users and items. This study shows that how you prepare the training data before fine-tuning these models changes how well they recommend and how fair the recommendations are across different groups. The authors found that including original item titles helps recommendations work better and balancing data for some demographics can reduce gaps between groups without hurting performance. However, balancing for gender didn't improve fairness and actually reduced usefulness. The study suggests that data preparation affects both accuracy and fairness and should be considered carefully together.
Open → 2611.03113v1

Fairness aware experiments improve reliable results across groups

Fairness-Aware Design for Contextual Experiments: Guaranteeing Reliability and Equity in Heterogeneous Subgroups

Abstract: Experimental design is critical for evidence-based decision-making in healthcare, marketing, and public policy. However, designing efficient experiments across heterogeneous subgroups presents significant challenges. Existing methods often optimize for statistical power or overall sample efficiency, overlooking crucial fairness considerations across these different subgroups. To address this gap, we introduce a Fairness-Aware Contextual Track-and-Stop Design (F-CTSD) algorithm. The proposed F-CTSD algorithm provides statistical guarantees on subgroup fairness while minimizing required sample sizes. We quantify the fairness-efficiency trade-off and derive the exact sample complexity for the proposed F-CTSD algorithm under its fairness constraints. We further theoretically prove that the proposed F-CTSD algorithm consistently produces accurate treatment effect estimates even under fairness requirements, enhancing statistical reliability. Numerical experiments show that the proposed F-CTSD algorithm outperforms existing methods, achieving higher sample efficiency while reducing subgroup fairness violations by 4.95%.

Sun 1 NovArtificial Intelligence
The gist
Designing experiments that work well for different groups of people at once is really hard. The authors created a method called F-CTSD that ensures experiments treat all groups fairly while still giving trustworthy results using fewer participants. Their approach balances fairness and efficiency and proves it works correctly with solid math. Tests show it beats older methods by reducing fairness mistakes while needing fewer samples.
Open → 2611.01867v1

Pro-active inference improves accuracy in costly data sampling

Pro-Active Inference

Abstract: Estimating a population mean is fundamental across scientific applications, but observing every outcome can be prohibitively expensive. Often, covariates and machine learning (ML) predictions are available for the full population, even when only a small subset of outcomes can be observed. How can we leverage this information to proactively select observations to label, update ML predictions as labels arrive, and construct statistically valid confidence intervals? We develop a general, without-replacement formulation of Pro-Active Inference (PAI), extending our earlier with-replacement approach and building on Active Statistical Inference. Rather than making fixed-order label-skip decisions, PAI proactively selects which observation to label next from the remaining covariate pool while accommodating online ML updates. We establish PAI's finite-sample unbiasedness and asymptotic validity, develop an improved finite-sample variance estimator, and extend PAI to superpopulation inference without Bonferroni corrections or $α$-splitting. We characterize PAI's potential efficiency gains over Batch Active Inference in a quasi-oracle setting, highlighting the role of prediction-residual imbalance. Across eight diverse datasets, PAI achieves greater sampling efficiency than Sequential Active Inference in the vast majority of tested settings with near-nominal statistical coverage, using the same ML predictor and uncertainty score. However, comparisons with simpler baselines such as Prediction-Powered Inference and uniform sampling, as well as the closely related Prediction-Powered Active Testing, reveal when additional adaptivity helps or hurts statistical efficiency. Through interpretable, theory-motivated diagnostics and frozen-ML ablations, we investigate when and why PAI gains or loses efficiency, highlighting the initial residual-estimation problem and subsequent online learning dynamics.

Mon 26 OctMachine Learning
The gist
Measuring the average outcome in a population is important but often expensive because you can't collect every data point. The authors introduce a method called Pro-Active Inference (PAI) that smartly picks which data points to label next by using existing predictions and information from the whole group. This approach updates predictions on the fly as new labels come in and aims to give precise estimates without wasting resources. Tests on multiple datasets show it usually outperforms previous methods, revealing when its adaptability helps or sometimes even hinders accuracy.
Open → 2610.34681v1

AI shoppers show hidden bias toward seller content with money value

A Cue's Hidden Price: Auditing Seller Influence on AI Shoppers

Abstract: Large language models are increasingly asked to shop on a user's behalf, which lets seller-controlled content such as badges, endorsements, and framing steer what they recommend. That poses the question at the core of generative engine optimization (GEO): not whether seller content shifts an agent's choice, but how much. The usual gauge of that influence, how often a cue wins the choice, has a blind spot: once a cue is strong enough to be picked almost every time, the choice rate can no longer show how much stronger one cue is than another. We introduce price-equivalent (PE) auditing, which removes this ceiling by pricing the cue in money. In a counterbalanced, position-controlled forced choice, we raise the cued product's price until it is chosen only half the time, and report that premium as the cue's price-equivalent: a formally defined, policy-conditioned parity threshold that makes very different cues comparable. Priced this way, cues that look equally strong at equal price differ by a wide margin, so choice-rate audits substantially under-resolve seller influence. We run the audit over 113,472 trials, seven models across families, and two product categories. To our knowledge, we also run the first price-equivalent audit of a decision-native model, Jev, which outputs a choice probability directly instead of generating text; strikingly, its profile is unlike any text model we tested, resisting most cues yet remaining susceptible to the strongest social-proof claims. We release the stimuli, logs, and code as a benchmark that reports each model's cue-price profile rather than a single score, giving developers and auditors a common, reproducible way to measure how content moves AI shopping agents.

Mon 19 OctArtificial Intelligence
The gist
AI shopping assistants often pick products influenced by seller badges and endorsements, but measuring how much these signals affect choices is tricky. The authors created a new way to measure this by raising the product's price until the AI is equally likely to reject it, revealing the 'price' of the seller's influence. Testing many models and products, they found some AI resist most cues except strong social proofs. Their method offers a clearer way to compare how AI shopping agents respond to seller content.
Open → 2610.25843v1

How emotions spread and shape decisions in social networks

How Do Emotions Spread And Affect Decision-Making In Social Networks? An Opinion Dynamics Perspective

Abstract: Emotions affect how we think and perceive information. Motivated by this, we present a novel framework for modeling emotions, and study its impact in social networks. We represent emotions on a circle by utilizing the circumplex model. These emotions spread in a group through the process of emotional contagion, and influence the interpersonal relationships therein. We propose a model to explain the process of emotional contagion, and its effect on the decision-making process, using a Laplacian-based flow. Our key finding in this direction shows that agents with similar emotions reach agreement eventually, exhibiting emotional contagion. Through this, the widely observed behaviors of consensus, polarization, and clustering of opinions follow in complex-weighted networks. Our approach relies on the equitable partitions and spectral properties of Laplacians in complex-weighted networks. Lastly, we validate our findings using synthetic and real-world datasets.

Thu 15 OctSocial and Information Networks
The gist
People's emotions influence how they think and make choices, and these emotions can spread through social groups. The authors created a new way to represent emotions on a circle and model how emotions pass between people and affect their relationships. They found that people with similar emotions tend to agree more over time, which can lead to groups forming around shared feelings or opinions splitting apart. Their findings were tested using both made-up examples and real social network data.
Open → 2610.22334v1

Structured hierarchical method improves private data insights for analytics

SHIP: Structured and Hierarchical Insight with Privacy

Abstract: Extracting insights from textual data while protecting user privacy is increasingly important. Existing methods produce private insights in diverse forms for different analytical purposes, making their utility difficult to assess and compare. In this work, we formulate differentially private (DP) insights as reusable representations for answering analytical queries, providing a common basis for utility assessment. Answering these queries, however, requires fine-grained details and cross-attribute statistics that existing representations may omit. To capture this information, we introduce Structured and Hierarchical Insight with Privacy (SHIP), which automatically maps queries to attributes, builds a hierarchical hybrid taxonomy, and releases a DP synthetic table for further analysis. We also develop an evaluation protocol based primarily on QA performance and structured fidelity. Our experiments demonstrate SHIP's strong performance on both measures relative to existing private insight baselines, while identifying queries that remain challenging for structured representations.

Thu 15 OctComputation and LanguageCryptography and SecurityMachine Learning
The gist
Extracting useful information from text data while keeping people's privacy safe is a hard problem. The authors introduce SHIP, a new way to organize and represent private information so that many types of analytical questions can be answered more accurately without revealing sensitive details. Their method builds a hierarchy of data categories and releases a synthetic, privacy-protected summary table, which helps researchers better understand the data. In tests, SHIP performed better than other methods, though some questions remain challenging.
Open → 2610.21048v1

Social network cascades influence how opinions spread and change

From Content Sharing to Opinion Shaping: A Theoretical Framework for Cascade-Driven Opinion Dynamics

Abstract: Online social networks (OSNs) tightly couple information diffusion and opinion formation, yet most existing models treat these processes separately. Building on the Friedkin-Johnsen on Cascades (FJC) model, which integrates opinion updating within stochastic information cascades, we advance its analytical characterization and systematic validation. We derive an exact conditional layer-wise recursion that reveals the statistical coupling between diffusion realizations and opinion evolution, showing that a closed-form recursion in unconditional expectations is not available. To overcome this limitation, we introduce a mean-field decoupling approximation (MFA) that yields a tractable linear recursion for the expected opinion trajectory. We also develop scalable tree-based reductions that drastically reduce computational complexity while preserving structural diffusion properties, and validate the analytical recursion and its approximations through extensive simulations. Using Stochastic Block Model networks with controlled initial opinion configurations, we show that, unlike the classical Friedkin-Johnsen model, which typically leads to global homogenization, the FJC dynamics generate richer regimes of bounded assimilation and sustained polarization. Overall, this work bridges diffusion and influence modeling, providing a theoretical foundation for understanding how cascade-driven interactions reshape collective opinion landscapes in structured social networks.

Wed 14 OctSocial and Information Networks
The gist
People often share information and form opinions online in connected ways, but most studies look at these separately. This paper builds on a model that treats sharing and opinion changes as connected processes. The authors developed new mathematical tools to better understand these linked dynamics and showed that opinions can remain diverse or become polarized instead of everyone agreeing. Their work helps explain how information sharing in social networks shapes public opinion over time.
Open → 2610.19867v1

Brand mentions in AI answers stay stable for over 20 days

Twenty Days Later: A Pre-Registered Test of History-Based Forecasts of Brand Mentions in Gemini Answers

Abstract: Counts of which brands a large language model names are useful only if they hold long enough to act on. We test this with a pre-registered replication. The same 162 requests (54 questions in English, Estonian and Finnish about three software categories, four of twelve candidate brands per question, three repeats) were sent to gemini-3.1-pro-preview in three waves within about ten hours on 22 and 23 September 2026, and again on 13 October 2026, 20.3 days after the third wave, with identical request bodies. The plan and its decision rule were frozen, hashed and registered on OSF before the first call. The outcome is a lexical mention label per answer and brand, 648 per wave. The primary forecast, each brand-and-question cell's mention rate over the nine earlier answers, scored Brier 0.0281 and log loss 0.126, against Brier 0.0259 for the six-answer forecast of the 8-hour wave and a registered ceiling of 0.0559. It beat brand history (0.104), the overall rate (0.234) and a constant 0.5 (0.250) on both scores and in all nine question families (exact sign-flip p = 0.0039), so durability holds under the registered rule. A forecast frozen from the first wave alone scored 0.0599, 0.0587 and 0.0604 at horizons of 1.5 hours, 9.6 hours and 20.7 days. Of the 202 cells unanimous in the 8-hour wave, 194 were unchanged at D1 and none reversed. The latest wave alone was nearly as accurate as the pooled history (Brier 0.0292; pooled lower in 5 of 9 families, p = 0.28). Every answer reported the requested model version, and none issued a search query although search was enabled. A blind human check of 96 labels agreed with the rule on 94; both disagreements were adjudicated as rater omissions, so after adjudication the rule matched on 96 of 96. The test covers one model, one interval and twelve known brands, and estimates no decay rate.

Wed 14 OctInformation RetrievalComputation and Language
The gist
Brand names mentioned by an AI model in its answers stay consistent for at least 20 days, according to a careful test. The researchers asked the AI the same questions multiple times on different days and checked if the brands it named stayed the same. They found that the AI’s answers changed very little over time, showing stable patterns of brand mentions. This means you can trust these brand counts for planning and analysis over several weeks.
Open → 2610.19608v1

Voter model with opinion graph limits influence based on opinion proximity

The Voter Model with Opinion Graph

Abstract: We study the \emph{voter model with opinion graph}, a generalization of the standard (pull) voter model that adds a notion of bounded confidence. In this process, we consider a finite set $A$ of $n$ agents. Each agent $u \in A$ has an opinion $x_u \in O$, where we model opinions as vertices in an undirected opinion graph $G = (O,E)$ with $|O|=q$. In each step, an agent $u$ interacts with another agent $v \in A$. In contrast to classical voting, $u$ adopts the opinion $x_v$ if and only if $x_v$ and $x_u$ are neighbors in $G$. The process is stable once all remaining opinions are an independent set in $G$. We analyze two variants of the process: the ordinary EdgeVOG process, which samples a pair of interacting agents uniformly at random from all possible pairs, and the productive EdgeVOG process, which samples only pairs with neighboring opinions in $G$. We show the following: - For every opinion graph and every initial configuration, ordinary EdgeVOG stabilizes within $O(n^2\log n)$ steps in expectation and with high probability. The expectation bound is asymptotically tight. For the productive EdgeVOG process, the expected stabilization time is exactly the initial number of compatible agent pairs, while $O(n^2\log n)$ steps suffice with high probability. - An opinion $i$ with initial support $s_i$ survives with probability at least $p_i:=s_i/(s_i+\sum_{j\in N(i)}s_j)$. Further, let $μ= \sum_{i \in O} p_i$, then we show the probability that less than $(1-δ)μ$ opinions survive is at most $\exp(-δ^2μ/(2(Δ^2+1)))$ for every $0\leqδ\leq1$. -If $G$ has maximum degree $Δ$ and every opinion initially has support at most $\hat{s}$, then no opinion ever acquires more than $\tilde{O}(\min\{n,Δ^6\hat{s}\})$ agents with high probability. This yields near-linear stabilization bounds for productive EdgeVOG for a large class of configurations.

Mon 12 OctComputer Science and Game TheoryDistributed, Parallel, and Cluster Computing
The gist
This work studies how opinions spread among a group of people when they only influence each other if their opinions are similar. The authors model opinions as points in a network where connections mean opinions are close enough to influence. They analyze how long it takes for opinions to stop changing and how likely each opinion is to survive over time. Their findings show that the process stabilizes quickly and predict how opinions grow or disappear based on their initial popularity and connections.
Open → 2610.16684v1

Small area learning improves estimates in domains with limited data

Small area learning

Abstract: Small area estimation (SAE) traditionally borrows strength across domains through a prespecified working model. We introduce small area learning (SAL), a learner-agnostic framework that formulates SAE as a multi-target semi-supervised learning problem and treats outcome prediction as a nuisance task. Areas may differ through unrestricted covariate shift and structured conditional shift, with information shared through common and area-specific components. We develop standard and cross-fitted estimators for low-complexity and flexible learners, unifying synthetic, model-based, and fully residual-corrected estimation. For area means, we establish consistency and asymptotic normality and provide variance estimators and confidence intervals. We extend the theory to settings with only aggregated population covariates and characterize the resulting aggregation bias. SAL reveals a bias--variance trade-off: partial residual correction can reduce mean squared error, whereas full correction yields estimators robust to working-model misspecification, potentially at higher variance. Simulations yield RMSE reductions of 34\%--49\% relative to direct estimation, with the best configuration varying across settings. An empirical application favours a cross-fitted estimator using a flexible learner under the chosen validation criterion. The numerical studies also illustrate how shrinkage can produce overly optimistic confidence intervals at the expense of strong modeling assumptions.

Sun 11 OctMachine Learning
The gist
Estimating outcomes in small areas or groups can be hard because each area may have limited data. The authors propose a new approach called small area learning that treats this as a multi-target learning problem and shares information flexibly across areas. Their method provides more accurate estimates and reliable confidence intervals, even when assumptions about the data differ between areas. They demonstrate improvements in simulations and a real example, and also explain when certain corrections help or hurt estimate accuracy.
Open → 2610.15953v1

Benchmark reveals flaws in how expert taste is measured in tests

How to Build a Benchmark That Actually Measures Taste

Abstract: Expert-aligned "taste" benchmarks should reward craft judgment, not the ability to game the test. We introduce TasteBench, a pairwise good-vs-bad benchmark across visual, brand, book, and tech items under a frozen rubric with expert-only gold (panel n>=3; percent agreement >=0.60 primary gate; weak engagement labels train/analysis-only), together with a control protocol that separates craft judgment from test-gaming. Applying the protocol to a Round-1 pilot (primary_human_expert; three biological human experts; n=250 pairs) surfaces and quantifies three validity threats: two construction artifacts that inflate the trivial-baseline layer, and a difficulty ceiling that inflates every score. (1) Position: the preferred item is slot A with probability 0.956, so an always_item_a policy scores 0.956 (fair chance 0.5). (2) Lexical leakage: a filename token cue scores 0.912. (3) Difficulty ceiling: craft domains show near-ceiling human agreement (book/brand/tech 1.0), and even under A/B randomization (eval_assignment_seed7; gold_side_A ~0.47) all five VLM cards reach 1.0 on craft, with only visual separating (~0.84-0.91; a post-hoc hard subset, n=107, leaves craft at 1.0). The protocol (expert-only gold, a weak-label firewall, side randomization at construction, filename scrubbing, and hard filters) makes each artifact measurable and, for the two construction artifacts, correctable; we release a reference eval harness and a side-randomization tool, and show the tool removes the position skew (0.916 to 0.495/0.505). The result is a calibrated view of what the benchmark does and does not yet measure: position and leakage are fixable, whereas the craft-domain ceiling is a pair-difficulty limit that Round-2 must address. We do not evaluate engagement, era/circle conditioning, or calibration here, and we claim no general taste SOTA.

Sat 10 OctArtificial IntelligenceComputation and LanguageComputer Vision and Pattern Recognition
The gist
Getting computers to judge taste, like choosing which book or brand is better, is tricky because some tests can be easily tricked. The authors created a new test called TasteBench that uses experts' opinions and special rules to make sure the test really measures good taste, not just who can cheat it. They found problems in the way previous tests were made, like always favoring one option or leaking hints that can be guessed. Their methods fix some of these problems but also show that some taste judgments are so hard that even experts fully agree, making it hard to improve further. More work is needed to make taste tests better and more reliable.
Open → 2610.14707v1

Social networks still learn truth with changing ways to mix opinions

Non-Bayesian Social Learning with Heterogeneous and Time-Varying Aggregation Rules

Abstract: People constantly form opinions by combining what they observe with what friends, collegues, and communities tell them. Following this idea, this article generalizes earlier results in Non-Bayesian social learning on strongly connected social networks, where agents repeatedly update their beliefs by combining their own private signals with the beliefs of their neighbors. Previous work assumed that every agent aggregates information in the same way and often does not change in time, assuming agents never change how they reason and listen to others. We show that agents' beliefs still converge almost surely to the true state when agents use heterogeneous and time-varying (non-stochastic) aggregation rules under certain conditions. That is, even when people change their way to aggregate others opinions, the community can still reach the truth as long as information flows among its members. We also provide convergence rate results under this scenario and show that, for some of these functions, it is at least equal to the best convergence rate we have found in the literature. We present the widely used aggregation functions in the Constant Elasticity of Substitution (CES) family as a specific case of our general model, which include rules such as the log-linear, DeGroot, and the harmonic rules, and provide a simple illustrative example to show the capabilities of the model.

Fri 9 OctSocial and Information Networks
The gist
People form opinions by mixing what they see and what others tell them. This paper shows that even if individuals use different and changing ways to combine information from their friends, the group can still learn the truth together. The authors prove that as long as information keeps moving among people, everyone’s beliefs will converge to the true state. They also find that some ways of mixing opinions can be just as fast as the best known methods.
Open → 2610.13611v1

Modeling social influence with hidden attention reveals stronger effects

Learning Social Influence with Unobserved Attention

Abstract: Social influence, the tendency of our social environment to sway our beliefs and behaviors, is often cited as a driver of population-level trends in opinions or beliefs. Many quantitative theories of social influence assume that an agent interacts with its entire social environment. This assumption is often unrealistic. For example, users of online platforms typically see posts from only a small subset of the accounts they follow at any given time. We introduce a simple probabilistic agent-based model of social influence that explicitly models unobserved attention mechanisms. The first of these latent mechanisms is selection: each agent interacts with only one other agent at a time from its social environment. The second is retention: the agent chooses whether or not to ignore the opinion of the other. Our model admits an efficient maximum-likelihood algorithm which allows us to fit it to opinion traces even when these mechanisms are unobserved. On synthetic data, omitting either latent mechanism reduces the overall strength of social influence governed by the inferred interaction kernel, which hides the evidence for the underlying nonlinearity of the social influence. We study a selection of previously analyzed empirical datasets and curate several new ones. We show that models that include the latent mechanisms are often more predictive on these datasets; indeed, they typically improve prediction far more than the choice of interaction kernel does. Modeling latent attention increases held-out predictive likelihood on 14 of these 15 datasets. Each mechanism changes the size of the inferred kernel in a predictable direction, while its effect on the kernel's shape depends on the data.

Thu 8 OctSocial and Information Networks
The gist
People don't pay attention to everything they see on social media, but past studies often assume they do. This paper introduces a new model that guesses who people actually notice and when they choose to ignore opinions. The authors show that including these hidden attention steps improves predictions about how social opinions spread. Their model even works well on many different real-world data sets.
Open → 2610.12616v1

Large language models enhance recommendations with structured decision memory

Beyond Sequences: Distilling Structured Decision Memory for LLM Recommendation

Abstract: Despite the adoption of large language models (LLMs) in recommendation systems, prevailing approaches mostly model single-type behaviors (e.g., views or purchases). Even when incorporating multiple behaviors, existing methods flatten heterogeneous actions into homogeneous token sequences, ignoring their distinct decision-making roles. This flattening fails to capture semantic hierarchies and contextual nuances in complex decision-making, such as trade-offs between price and quality. Consequently, performance degrades in critical ``difficult-choice'' scenarios involving highly similar items. To bridge this gap, we propose MARI (Memory-Augmented Recommendation with Interpretability), which grounds predictions in explicit, structured decision evidence. MARI maintains a Decision Memory Bank (DMB) that archives users' past rationales as Structured Decision Memories (SDMs): concise records of goals, constraints, and trade-offs. These SDMs are generated offline via Post-Hoc Decision Distillation from heterogeneous behaviors and user-generated content. By retrieving relevant SDMs to augment LLM reasoning, MARI achieves interpretability and scalability without the prohibitive cost of processing long raw sequences. Extensive experiments show MARI significantly outperforms state-of-the-art baselines on standard next-item prediction and a newly introduced Difficult Choice Prediction task, incurring low latency overhead by decoupling memory construction from online inference. Qualitative analyses reveal actionable, human-readable insights into user decision-making, marking a concrete step toward reasoning-aware recommendation systems.

Thu 8 OctComputation and Language
The gist
Current recommendation systems often look at user actions as simple sequences, missing the reasons behind choices. The authors propose a new method called MARI that keeps a structured memory of users' past decision reasons, like goals and trade-offs between options. This helps the model make better predictions, especially when items are very similar and choices are hard. MARI also explains its recommendations in understandable ways without slowing down the system much.
Open → 2610.11501v1

AI moderation matches humans and finds more customer needs

AI-Moderated Interviews for Market Research and Digital Twins Calibration

Abstract: AI-moderated interviews are emerging as a scalable market-research method for generating consumer insights and building consumer "digital twins." Yet it remains unclear whether they match human-moderated interviews or improve on simpler, static data collection methods. In a pre-registered, between-subjects study (N = 317) with three industry partners, we compare AI-moderated (N = 139), human-moderated (N = 24), and static interviews (N = 154). AI moderation matches human moderation in depth, covers more themes, and, holding budget constant, recovers significantly more customer needs than human moderation or static interviews. However, participants sound more emotionally engaged when speaking to a live human. We then create digital twins using interview data and evaluate each twin against the participant's own held-out responses to six real-world marketing stimuli. We find that digital twins created from AI-moderated interviews predict consumer responses better than demographics-only personas. However, the additional richness from AI moderation does not translate into better quantitative predictions compared to static interviews. By analyzing open-ended thoughts generated from humans versus their twins, we find that prediction errors are connected both to differences in (self-reported) thinking styles between twins and humans, and to gaps between training and validation data (i.e., asking questions that are too far out of distribution).

Thu 24 SeptComputers and SocietyArtificial IntelligenceHuman-Computer Interaction
The gist
Finding out what customers want is important but expensive when done by humans. The authors tested AI-led interviews against human and simple surveys with real participants. They found that AI interviews gathered as many insights as human ones and even discovered more customer needs when the budget was the same. However, people felt more emotionally connected talking to humans. The AI data helped make digital models of customers, which predicted responses better than simple demographic profiles but not better than static surveys.
Open → 2609.29143v1

Large language model improves measuring consumer values from shopping behavior

Behavior2Value: Benchmarking and Empowering LLMs for Consumer Value Measurement from E-commerce Behaviors

Abstract: Human values are deep motivational orientations that shape human behaviors. In e-commerce, they reveal the stable drivers behind users' purchase decisions. Compared with short-term interests, consumer values better explain how users evaluate products before purchase. However, consumer values are often implicit in complex and fragmented behavioral trajectories, leaving value measurement from e-commerce behaviors largely underexplored. To this end, we propose the Behavior-to-Value (B2V) task, which aims to identify consumer values from e-commerce behavioral trajectories. Centered on this task, we first construct the E-commerce Consumption Value Taxonomy (ECVT) and introduce B2V-Bench, the first B2V dataset and benchmark, based on anonymized Taobao behavioral logs. B2V-Bench consists of real-world purchase decision episodes, covering 25 types of purchase behaviors, along with corresponding consumer value orientations manifested in each episode. To improve consumer value measurement accuracy, we further present B2V-Verifier, a behavior-to-value measurement model based on Value Verification Tuning, which learns to assess whether behaviors provide sufficient evidence for each value inference. Experiments show that B2V-Verifier outperforms strong LLM baselines, improving multi-label classification by 34\%. The dataset and code will be publicly released upon acceptance.

Wed 16 SeptComputation and LanguageMachine Learning
The gist
People’s values influence what they buy, but these values are hidden in the complicated paths of their online shopping actions. The authors created a way to identify these values from shopping behavior using a new dataset based on Taobao logs. They developed a model, called B2V-Verifier, that better detects consumer values from these behaviors than previous language models, improving accuracy significantly. This work helps understand why consumers make certain purchase decisions.
Open → 2609.18203v1

AI generated data can change causal experiment questions and results

When AI Generates Covariates: Causal Typing and Estimand Drift in Sequential Experiments

Abstract: AI-generated covariates from notes, conversations, images, and wearable streams can change the causal question when their roles are left unspecified. A generated feature may represent a treatment version, pre-action state, history, design variable, mediator, outcome proxy, observation process, or intercurrent event; these roles are not interchangeable. We formulate a causal type discipline for sequential experiments: a versioned representation map, a causal role classifier, a claim-status filter, and an estimand lock. The lock fixes a standardized proximal effect before generated covariates enter the analysis. Under audit correctness and standard identification assumptions, admissible role assignments preserve this estimand. We apply the established conditional-covariance characterization of compression bias to substitution of generated representations for design-relevant states. A standardized decomposition separates compression, conditional-law, and standardization drift. Further results cover mediator adjustment, post-action leakage, marker-intervention conflation, outcome-guided discovery, and state-measurement error. Cluster-level orthogonal estimators distinguish empirical and superpopulation targets under repeated sessions and missing outcomes. Simulations show that refinement helps when it retains design-relevant information, whereas design erasure, leakage, and same-data marker selection can produce bias or undercoverage. The framework places causal semantics and claim status before confirmatory inference with generated representations.

Tue 15 SeptArtificial Intelligence
The gist
When artificial intelligence creates data from things like notes or images, it can change what a study is actually measuring, especially in experiments done step-by-step. The authors explain that these AI-created features can play many different roles in a study, and confusing these roles can lead to mistakes in interpreting results. They propose a clear way to classify AI-generated data and keep track of what question the study answers. Their approach helps avoid errors that come from mixing up treatment effects with other types of data changes. They also tested their ideas with simulations showing their methods can improve analysis when the AI data keeps important information.
Open → 2609.17772v1

Interpretable random forests improve treatment effect predictions and insights

Splitting the Difference: Interpretable Causal Forests for Treatment Effect Heterogeneity and Bias

Abstract: In various fields, such as medicine and marketing, accurately predicting individual treatment effects holds significant promise. However, achieving reliable predictions alone is often insufficient for making informed decisions; it is equally important to understand why the treatment effect is higher for some individuals than for others. To address this two-fold challenge of prediction and interpretation, we introduce an algorithm based on decision trees and random forests for estimating individual treatment effects. Our algorithm is simple: it operates exactly like a standard random forest, but with a different splitting criterion, and requires no additional workarounds such as double machine learning or orthogonalization as used in Generalized random forests. It handles observational studies with varying treatment propensities without requiring separate estimation of the full propensity function. This is achieved by combining two splitting criteria---one targeting heterogeneity in the treatment effect, the other targeting bias correction for the average treatment effect---which together improve split point selection and automatically distinguish confounders from features responsible for heterogeneity. As a result, interpretation follows directly from the fitted tree structure itself, that is, from which features the trees split on and with which split statistics, without requiring separate post-hoc analysis. For the theoretical analysis of this algorithm, we consider a change point model with step functions for potential outcomes and treatment propensity and provide insights into the theoretical underpinnings of our approach. Simulation studies show that our simple algorithm achieves comparable, and often better, prediction accuracy than existing methods, while substantially improving interpretability.

Tue 15 SeptMachine Learning
The gist
Predicting who benefits most from a treatment is important but hard to understand. The authors created a simple tree-based method that not only predicts effects well but also explains which factors cause differences between people. Their approach works with biased data without extra complicated steps and shows results directly through the tree structure. Tests show it predicts as well or better than existing methods while being easier to interpret.
Open → 2609.16971v1

Large language models improve social network modeling and dynamics

LLMs for Social Network Modeling: From Network Generation to Dynamic Processes

Abstract: Large language models (LLMs) are rapidly emerging as a new paradigm for modeling social networks by representing users and their relationships and interactions through natural language. Unlike classical network models or deep learning approaches, LLMs can simulate context-aware social behavior and language-driven interactions, enabling more realistic modeling of network formation and dynamic social processes. However, existing studies are scattered across different research communities and lack a unified perspective. This survey presents the first comprehensive review of LLMs for social network modeling by organizing the literature into two broad categories: network generative models and dynamic process models. Network generative models are further classified into selection-based and interaction-based approaches, while dynamic process models are categorized into opinion dynamics, information diffusion, and rumor propagation, each with their underlying modeling mechanisms. LLMs enable rich textual social interactions and decision-making, but they also exhibit many limitations, including inherent social biases and prompt sensitivity. We outline these open research challenges and discuss future directions in LLM-based social network modeling.

Mon 7 SeptSocial and Information NetworksArtificial Intelligence
The gist
Social networks are complicated, with people interacting and sharing opinions in many ways. The authors survey how large language models (LLMs) can represent users, their relationships, and conversations using natural language. These models help simulate how social networks form and evolve, including how information and rumors spread or how opinions change. The paper groups current research into categories based on network creation and dynamic social behaviors, while noting challenges like bias and sensitivity to input. They also outline directions for improving the use of LLMs in social network studies.
Open → 2609.08049v1