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.

168,932 papers · 148 categories

Trend · papers per month

2.3%4.5%6.8%9.1% · Dec 199419922001200920172026
48 results for style refinement

Method retrieves similar fashion items from images and text, enabling style refinement.

problem Lack of intuitive, interactive refinement in search engines for fashion items.
method Joint visual-textual embedding training, Mini-Batch Match Retrieval, attribute extraction.
result Improved performance in multimodal style search, demonstrated through benchmark.

XL-Editor improves sentence post-editing using XLNet's variable-length insertion probability.

problem Post-editing sentences to refine generated text.
method XL-Editor trains XLNet to estimate variable-length insertion probabilities and apply post-editing operations.
result XL-Editor outperforms XLNet on text insertion and deletion tasks, and achieves significant style transfer improvements.

GOTabPFN improves tabular model performance with compact tokenization for HDLSS data.

problem Making tabular models effective for high-dimensional, low-sample size data without retraining.
method Introducing Graph-guided Ordering with Local Refinement (GO-LR) and Neuro-Inspired Subunit Compression (NSC) to create compact meta-features.
result GOTabPFN improves stability and accuracy in tabular benchmarks with compact tokenization.

Study examines if LLMs' trading styles match real market behavior.

problem Lack of behavioral consistency in LLMs' trading strategies.
method Year-long simulations with LLMs, operationalizing behavioral finance drivers, and comparing with financial theory.
result LLMs' strategy switching is only partially consistent with behavioral finance theories.

Over the past decade there has been considerable interest in spectral algorithms for learning Predictive State Representations (PSRs). Spectral algorithms have appealing theoretical guarantees; however, the resulting models do not always perform well on inference tasks in practice. One reason for this behavior is the m…

2017-02-14abs ↗pdf ↗

Paper proposes a method to extract style features from unlabeled data.

problem Extracting fine-grained features like styles from unlabeled data.
method Contrastive conditioned variational autoencoders with mutual information constraints.
result The method efficiently extracts style features from real-world natural image datasets.

Fund2Persona creates personalized financial advisor personas from fund data, improving investment advice.

problem Lack of consistent advisor expertise and difficulty in encoding it in LLM systems.
method Grounds financial advisor personas in fund disclosures, market context, and manager commentary through an agentic actor--scorer--patcher loop.
result Personas better recover portfolio decisions and manager interpretation than generic baselines.

Study examines Indian equity mutual funds' investment style and risk-shifting.

problem Understanding how Indian equity mutual funds' investment styles affect their returns.
method Estimating size and style beta coefficients, identifying breakpoints, analyzing investment styles, and assessing risk-shifting intensity.
result Funds can enhance returns by shifting to high-return styles like Small Value and Small Blend.

Fund2Persona creates personalized financial advisor personas from fund data, improving investment advice and manager interpretation.

problem Lack of consistent and specific financial advisor expertise in personalized investment advice.
method Grounds financial advisor personas in fund disclosures, holdings transitions, market context, and manager commentary through an agentic actor--scorer--patcher loop.
result Personas better recover portfolio decisions and grounded manager interpretation than generic baselines.

The paper tackles calibrating long-term behaviors with multiple styles using programmatic style-consistency.

problem Generating long-term sequential behaviors with multiple styles simultaneously.
method Leverage programmatic labeling functions to specify controllable styles and derive style-consistency as a learning objective.
result Learned policies can be calibrated for up to 1024 distinct style combinations.

Text style transfer aims to modify the style of a sentence while keeping its content unchanged. Recent style transfer systems often fail to faithfully preserve the content after changing the style. This paper proposes a structured content preserving model that leverages linguistic information in the structured fine-gra…

2018-10-15abs ↗pdf ↗

Improved TTS style transfer across disjoint datasets with adversarial cycle consistency.

problem Suboptimal TTS style transfer on disjoint datasets with underrepresented styles.
method Adversarial cycle consistency training with paired and unpaired triplets.
result 78% improvement in style transfer with minimal reduction in fidelity and naturalness.

RB-Modulation trains free diffusion models without external adapters.

problem Training-free personalization of diffusion models with style and content control.
method Stochastic optimal control with a style descriptor and cross-attention aggregation.
result Precise content and style extraction and control without external adapters.

In this paper, we price American-style Parisian down-and-in call options under the Black-Scholes framework. Usually, pricing an American-style option is much more difficult than pricing its European-style counterpart because of the appearance of the optimal exercise boundary in the former. Fortunately, the optimal exer…

2015-11-05abs ↗pdf ↗

We use customer demand data for fashion articles on Myntra, and derive a fashionability or style quotient, which represents customer demand for the stylistic content of a fashion article, decoupled with its commercials (price, offers, etc.). We demonstrate learning for assortment planning in fashion that would aim to k…

2018-06-28abs ↗pdf ↗

New algorithm improves online learning with reduced discretization.

problem Improving adaptive online learning with refined discretization.
method Continuous time approach to online learning, followed by a new discretization argument.
result Optimal regret bound with O(VT)O(\sqrt{V_T}) dependence on gradient variance.

Analyzed writing style changes in Danish high school students.

problem Detecting global development trends and identifying at-risk students in high school writing.
method Used a Siamese neural network to compute essay similarity and clustered student profiles.
result High school students' writing styles become less similar as they progress, with some students showing significant improvement and others limited development or setbacks.

In this paper, we introduce an unsupervised learning approach to automatically discover, summarize, and manipulate artistic styles from large collections of paintings. Our method is based on archetypal analysis, which is an unsupervised learning technique akin to sparse coding with a geometric interpretation. When appl…

2018-05-28abs ↗pdf ↗

New method disentangles style features from data augmentations.

problem Difficulty in deducing which data attributes are 'style' and should be discarded.
method Structured data augmentation with multiple style embedding spaces, maximizing joint entropy.
result Empirically demonstrates benefits on synthetic and real-world data.

We consider visual domains in which a class label specifies the content of an image, and class-irrelevant properties that differentiate instances constitute the style. We present a domain-independent method that permits the open-ended recombination of style of one image with the content of another. Open ended simply me…

2018-09-28abs ↗pdf ↗

Style Miner generates stable and significant style factors for time series analysis.

problem Finding significant and stable explanatory factors in high-dimensional time series data.
method Proposes a reinforcement learning method to balance explanatory power and stability constraints.
result Outperforms existing methods by a large margin and achieves a 10% gain in R-squared explanatory power.

This work improves disentanglement by preventing style variables from encoding content-related features.

problem Disentanglement of content and style in data representations using Variational Autoencoders.
method Adversarial training with mutual information minimization to prevent content information leakage in style representations.
result The method efficiently separates content and style related attributes and generalizes to unseen data.

The paper finds new inequalities for convex polygons.

problem Finding precise inequalities for convex polygons.
method Analytic isoperimetric inequalities based on Schur convex functions, followed by Bonnesen-style and inverse Bonnesen-style inequalities.
result Sharp discrete isoperimetric inequalities for planar convex polygons.

Paper stabilizes bandit learning with regularization, improving inference under adaptive sampling.

problem Challenges in statistical inference with adaptive sampling.
method Refined stability condition for online algorithms, using regularized stochastic-mirror-descent-style methods.
result Derives precise regret bounds and asymptotic normality, showing necessity of regularization for valid inference.

COLoKe adapts Koopman embeddings online, reducing overfitting and improving long-term predictions.

problem Online adaptation of Koopman embeddings to avoid overfitting and maintain long-term predictive accuracy.
method Combines deep feature learning with multistep prediction consistency in a lifted space, using a conformal-style mechanism for selective updates.
result Empirically effective in reducing overfitting and maintaining long-term predictive accuracy.

Unified framework for ICL in causal and masked models.

problem Understanding ICL in masked language models and comparing it to causal models.
method Developed a statistical learning framework representing context by empirical measure and predicting using context and query.
result Upper bounds for masked and autoregressive objectives under Wasserstein-type regularity conditions.

A method for disentangling text representations without supervision.

problem Challenges in learning disentangled representations of natural language.
method Information-theoretic guidance to induce independent style and content embeddings.
result High quality disentangled representations in terms of content and style preservation.