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.

169,181 papers · 148 categories

Trend · papers per month

72144216288 · Jun 202019922001200920182026
48 results for Attribute intensity control

AttGAN edits facial attributes by changing only what you want, preserving details.

problem Facial attribute editing with preservation of details.
method Encoder-decoder architecture with attribute classification and reconstruction learning.
result Outperforms state-of-the-arts on realistic attribute editing with preserved details.

Method uses ANN to estimate incentive salience from large behavioral data.

problem Estimating incentive salience in naturalistic settings.
method Artificial Neural Networks (ANNs) for latent state approximation.
result ANNs produce better representations for predicting future behaviour.

Generates text with specified attributes, improving content compatibility.

problem Modifying textual attributes of sentences while maintaining content compatibility.
method Introduces reconstruction and adversarial losses to generate attribute-compatible, realistic sentences.
result Demonstrates superior content compatibility and attribute control compared to prior methods.

Generic generation and manipulation of text is challenging and has limited success compared to recent deep generative modeling in visual domain. This paper aims at generating plausible natural language sentences, whose attributes are dynamically controlled by learning disentangled latent representations with designated…

2017-03-02abs ↗pdf ↗

In-Run Data Shapley offers efficient data attribution for large-scale models.

problem Existing data attribution methods are computationally intensive and cannot target specific models.
method In-Run Data Shapley, which efficiently attributes data contributions to a specific model without re-training.
result In-Run Data Shapley achieves significant efficiency, enabling data attribution for pretraining models.

GGDA simplifies DA for large models, speeding up attribution by up to 50x.

problem Computational intensity of existing DA methods limits their applicability to large-scale models.
method Generalized Group Data Attribution (GGDA) framework attributing to groups of training points.
result GGDA achieves up to 50x speedups over standard DA methods while maintaining effectiveness.

The paper quantifies and attributes uncertainty in complex system simulations.

problem Uncertainty in complex system simulations due to unknown or approximated subprocesses.
method Developed a framework for quantifying and attributing submodel uncertainty using bootstrapping, Bayesian model averaging, and tree-based methods.
result Individual submodels contribute to overall uncertainty, and their importance can be quantified.

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

2017-05-28abs ↗pdf ↗

New method identifies proxies for causal effects on multiple outcomes.

problem Estimating causal effects in scenarios with multiple outcomes and treatments.
method Causal discovery method leveraging multiple outcomes as proxies for each treatment effect.
result Parallel studies of multiple outcomes can assist in causal identification.

Novel model for predicting event intensities from static and time series data.

problem Predicting event intensities from static and irregularly sampled time series data.
method Neural controlled differential equations and signature-based CoxSig model.
result The CoxSig model provides theoretical learning guarantees and performs well on various datasets.

Generative model tackles inconsistent attributes across datasets by enabling precise conditional generation.

problem Inconsistent attributes across merged datasets limit controllability in conditional generative modeling.
method Diffusion Model with Double Guidance, maintaining control over multiple conditions without joint annotations.
result Outperforms baselines in molecular and image generation tasks, aligning with target distributions and controlling missing conditions.

Develops a method for constructing KBs with tunable precision for subjective and factual attributes.

problem Complexity in measuring subjective attributes complicates precision estimation in KBs.
method Probabilistically models user consensus with respect to each entity-attribute pair, using neural networks to fit the model.
result Learned models can successfully control KB's precision and outperform baselines in attribute prediction.

Framework for continuous-time network data representation learning.

problem Learning reliable representations of dynamic network interactions.
method Three-stage process: intensity estimation, projection learning, evolving node representation construction.
result Trajectories satisfy structural and temporal coherence, providing robust inference.

We consider a framework for solving optimal liquidation problems in limit order books. In particular, order arrivals are modeled as a point process whose intensity depends on the liquidation price. We set up a stochastic control problem in which the goal is to maximize the expected revenue from liquidating the entire p…

2011-05-02abs ↗pdf ↗

DVA framework attributes value of predictive models to features, configurations, and interactions.

problem Lack of explanation for how predictive models influence operational decisions.
method Shapley-based cooperative game theory applied to predict-then-optimize systems.
result DVA can guide targeted interventions to align model beliefs with operational performance.

EigenGAN discovers interpretable dimensions in GAN layers for semantic control.

problem Lack of explicit dimensions to control semantic attributes in GAN layers.
method EigenGAN embeds linear subspaces with orthogonal bases into each generator layer, learning eigen-dimensions corresponding to semantic attributes via adversarial training.
result EigenGAN can produce samples with continuous changes corresponding to specific semantic attributes.

The paper tackles data misappropriation in LLMs by embedding watermarks and testing for their presence.

problem Detecting data misappropriation in LLMs trained on copyrighted data.
method Embedding watermarks, formulating as hypothesis testing, developing statistical framework, constructing test statistics, determining optimal thresholds, controlling errors, establishing asymptotic optimality.
result The proposed statistical testing framework effectively detects data misappropriation in LLMs.

EXOC framework uses auxiliary variables for counterfactual fairness in machine learning.

problem Balancing fairness and predictive accuracy in models with sensitive attributes.
method EXOC framework uses auxiliary variables to define an auxiliary node and a control node for counterfactual fairness.
result EXOC framework outperforms state-of-the-art approaches in achieving counterfactual fairness.

A new model for predicting market order book dynamics using a buffer Hawkes process.

problem Predicting the evolution of limit order books in financial markets.
method Introducing a Markovian single point process with a buffer mechanism and self-exciting effect.
result The model accurately predicts market order book dynamics and converges to Brownian motion.

RKHS-SHAP uses Shapley values for kernel methods to provide feature attributions.

problem Feature attribution for kernel methods is often heuristic and not individualised.
method RKHS-SHAP uses Shapley values from coalition game theory to compute feature attributions for kernel machines efficiently.
result RKHS-SHAP can compute both Interventional and Observational Shapley values.

Smoothing graphons improve link prediction in Bayesian SBM without increasing computational complexity.

problem Accurate modeling of exchangeable relational data with flexible and computationally efficient graphons.
method Introducing smoothing procedures to piecewise-constant graphons to create smoothing graphons, which allow continuous intensity values for relations.
result Smoothing graphons improve AUC and precision for link prediction in real-world data sets.

Concept modulation models unify identifiability and extrapolation in conditional latent variable models.

problem Reliable generalization in conditional latent variable models
method Concept modulation models (CMMs) with structure AoΛoCoXA o Λ o C o X
result Lifts identifiability to conditional settings and controls extrapolation through attribute potentials.

New method designs antimicrobial peptides with high potency and low toxicity.

problem Designing potent antimicrobial drugs with low toxicity.
method CLaSS method using deep generative autoencoder and atomistic simulations.
result Design and synthesis of two novel AMPs with high potency and low toxicity.

A system for attributing ad effects using a neural network and Shapley values.

problem Attributing ad effects to individual ads in a complex, sequential environment.
method A two-step approach: response modeling with RNN and credit allocation with Shapley values.
result The system accurately allocates incremental ad effects to individual ads, handling sequence dependence.

Improved scalability and interpretability in training data attribution.

problem Identifying which training data drives specific behaviors, especially unintended ones.
method Leveraging interpretable structures within the model to attribute model behavior to semantic directions, not individual test examples.
result Simple probe-based attribution methods are first-order approximations of Concept Influence that achieve comparable performance while being over an order-of-magnitude faster.

Estimation of the intensity of a point process is considered within a nonparametric framework. The intensity measure is unknown and depends on covariates, possibly many more than the observed number of jumps. Only a single trajectory of the counting process is observed. Interest lies in estimating the intensity conditi…

2017-02-17abs ↗pdf ↗

Unified market making controls risk, arbitrage, and volatility surfaces.

problem Market making risk, arbitrage, and volatility surface consistency.
method Constrained RL and stochastic control for risk-sensitive execution and hedging.
result Agent achieves positive P&L with zero calendar and butterfly violations.

Better Hessian approximations improve influence function attributions in deep learning.

problem Influence functions are difficult to compute due to ill-conditioned Hessians, leading to poor data attribution performance.
method Investigated the impact of Hessian approximation quality on influence-function attributions in a controlled setting.
result Better Hessian approximations consistently yield better influence score quality.

Study optimal dividend strategies for insurers with natural catastrophe claims.

problem Maximizing dividends for a catastrophe insurer over its lifetime.
method Two-dimensional stochastic control problem, viscosity solutions, numerical approximation.
result Optimal dividend strategies identified for natural catastrophe insurers.

Method learns latent constraints for conditional generation without retraining.

problem Creating new conditional controls is expensive and requires retraining.
method Post-hoc learning of latent constraints to conditionally sample from desired regions.
result Generative models can conditionally sample with minimal retraining.

Intelligent control for greenhouses using deep reinforcement learning.

problem Uncertain nonlinear system of greenhouse environment control.
method Model Embedded Deep Reinforcement Learning (MEDRL) with computer vision and crop growth models.
result Precision and convenience in precise control of greenhouse environment.