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,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920182026
48 results for Intermediate Representation (IR)

Paper proposes a new method to learn code semantics using an Intermediate Representation (IR) and embeddings.

problem Lack of robust methods to comprehend program semantics robustly.
method Defines an embedding space (inst2vec) based on IR of code, leveraging both data- and control-flow.
result A single RNN architecture and fixed inst2vec embeddings outperform specialized approaches on various tasks.

Myia compiler optimizes ML models with efficient AD for array programming.

problem Efficient automatic differentiation for array programming in ML.
method Introduces a new graph-based IR that supports function calls, higher-order functions, and recursion.
result Myia compiler enables efficient AD using source transformation without a tape, supporting higher-order derivatives.

Study of M{\cal M}-theory dual of thermal QCD-like theories at intermediate coupling.

problem Missing top-down holographic dual for thermal QCD-like theories at intermediate 't Hooft coupling.
method Analysis of O(R4){\cal O}(R^4) corrections and O(lp6){\cal O}(l_p^6) corrections in the MQGP background.
result Discovery of O(R4){\cal O}(R^4) corrections and GG-structure classification of underlying geometries.

Consider the nonstandard embedding of SO(3) into SO(5) given by the 5-dimensional irreducible representation of SO(3), henceforth called SO(3)_\ir. In this note, we study the topology and the differential geometry of 5-dimensional Riemannian manifolds carrying such an SO(3)_\ir structure, i.\,e. with a reduction of the…

2010-10-01abs ↗pdf ↗

Turnover-adjusted IR is always lower than classic IR, suggesting managers can improve performance by limiting turnover.

problem The classic relationship between IR and its determinants does not account for turnover costs.
method Mathematical derivations and simulations considering volatility of information coefficient and portfolio turnover.
result Turnover-adjusted IR is lower and managers can improve performance by limiting turnover.

LIT compresses deep networks by training intermediate representations, outperforming traditional methods.

problem Reducing the computational overhead of deep network inference.
method LIT trains a student model with the same width but shallower depth, using the intermediate representations from the teacher model.
result LIT achieves substantial network depth reductions without accuracy loss, outperforming traditional methods.

Enhances deep learning by boosting generalization and convergence.

problem Improving generalization and convergence in deep learning models.
method Implicit Regularization Enhancement (IRE) framework that decouples flat and sharp directions.
result IRE consistently improves generalization performance across various deep learning tasks and models.

In the past 20 years, momentum or trend following strategies have become an established part of the investor toolbox. We introduce a new way of analyzing momentum strategies by looking at the information ratio (IR, average return divided by standard deviation). We calculate the theoretical IR of a momentum strategy, an…

2014-02-13abs ↗pdf ↗

Self-supervised and supervised methods learn similar intermediate visual representations but diverge in final layers.

problem Comparing self-supervised and supervised methods for visual learning.
method Comparison of contrastive self-supervised and supervised methods on simple image data.
result Contrastive and supervised methods learn similar intermediate representations but diverge in final layers.

We present an unsupervised approach for discovering semantic representations of mathematical equations. Equations are challenging to analyze because each is unique, or nearly unique. Our method, which we call equation embeddings, finds good representations of equations by using the representations of their surrounding …

2018-03-24abs ↗pdf ↗

Paper introduces a new method to improve learning on imbalanced regression problems.

problem Imbalanced distribution learning in predictive modeling reduces standard algorithms' performance.
method The paper proposes a novel method using disentangled VAEs and Smoothed Bootstrap in the latent space.
result The method improves learning on tabular data within the Imbalanced Regression framework.

Study of IR phases in 3D class R theories linked to non-hyperbolic 3-manifolds.

problem Understanding IR phases of 3D class R theories associated with non-hyperbolic 3-manifolds.
method Analysis of IR phenomena through `exceptional' Dehn fillings and gauging of flavor symmetries.
result 3D class R theories associated with certain atoroidal non-hyperbolic 3-manifolds exhibit supersymmetry enhancement at low energy.

Graph Convolutional Networks improve prosthetic sensation interpretation.

problem Improving neuroprosthetic performance and sensory information stability.
method Applied Graph Convolutional Networks (GCNs) to interpret neuronal spiking activity.
result GCN model achieved 73.5% performance on ordinal regression task.

Neural networks benefit from intermediate representations, reducing sample complexity.

problem Understanding how neural networks leverage intermediate representations for hierarchical learning.
method Fixed, randomly initialized neural network as a representation function, compared with raw inputs and other trainable networks.
result Neural representations can achieve improved sample complexities compared to raw inputs, especially for low-rank polynomials.

Model shows IRS procedure for health insurance tax credits can diverge, proposing a new bisection method.

problem IRS procedure for calculating health insurance tax credits diverges for some self-employed taxpayers.
method Proposed a bisection procedure to calculate appropriate premium tax credits for tax returns.
result The bisection procedure can calculate appropriate premium tax credits for a model of simple tax returns.

Proposes KTAN for better training of student networks with both intermediate representations and probability distributions.

problem Reduces large computation and storage cost of deep networks by transferring generalization ability.
method Holistically considers intermediate representations and probability distributions; uses a Teacher-to-Student layer and adversarial learning.
result Significantly improves performance of student networks on image classification and object detection tasks.

At present, there is an explosion of practical interest in the pricing of interest rate (IR) derivatives. Textbook pricing methods do not take into account the leptokurticity of the underlying IR process. In this paper, such a leptokurtic behaviour is illustrated using LIBOR data, and a possible martingale pricing sche…

2004-01-23abs ↗pdf ↗

This paper introduces a novel approach to measuring privacy risks in deep computer vision models based on intermediate outputs.

problem The exposure of intermediate results in hidden layers of deep computer vision models poses significant privacy concerns.
method The approach leverages Degrees of Freedom (DoF) to evaluate the amount of information retained in each layer and combines this with the rank of the Jacobian matrix to assess sensitivity to input variations.
result The proposed framework provides deeper insights into privacy risks associated with intermediate representations without requiring adversarial attack simulations.

Paper proposes a new framework to compare trading strategies by accounting for market conditions.

problem Lack of information on how trading strategy performance varies with market conditions.
method Uses a GAMLSS/ZAGA framework to model the Adjusted Information Ratio (IRIR^{\ast}) for a SVMP and BH strategy across 146 folds of the S&P 500.
result Dominance of SVMP over BH is conditional on market regime, as shown by differences in expected IRIR^{\ast} and its variance.

A new resampling strategy, Importance Resampling, improves sample efficiency and reduces variance in off-policy prediction.

problem High variance updates in importance sampling for off-policy prediction.
method Importance Resampling (IR) resamples experience from a replay buffer and applies standard on-policy updates, avoiding importance sampling ratios.
result Importance Resampling (IR) shows improved sample efficiency and lower variance updates compared to other methods.

Generative AI reduces IR evaluation costs but introduces errors; this work provides reliable CIs.

problem Generating relevance annotations using AI introduces errors that affect IR evaluation metrics.
method Proposes two methods: prediction-powered inference and conformal risk control to place reliable CIs around IR metrics.
result Proposed methods accurately capture both variance and bias in evaluation based on AI-generated annotations.

The paper studies symplectic structures on character varieties of Sasakian threefolds.

problem Character varieties of Sasakian threefolds and their symplectic structures.
method Constructing a natural algebraic 2-form and showing its properties.
result The restriction of the 2-form to the space of irreducible SU(r) homomorphisms is symplectic.

Investigate using LETFs to outperform benchmarks, finding them more likely to succeed.

problem The controversy and popularity of LETFs in constructing portfolios.
method Systematic investigation using IR-optimal strategies with LETFs and VETFs, including neural network-based approaches.
result IR-optimal strategies with LETFs outperform benchmarks and achieve partial stochastic dominance.

A new activation function improves credit scoring accuracy for imbalanced datasets.

problem Imbalanced datasets in credit scoring lead to underestimation of misclassification costs.
method Introduces ASIG, an asymmetric adjusted Sigmoid function.
result ASIG-embedded classifier outperforms traditional classifiers across various imbalance ratios.

End-to-end learnable network for safer self-driving with interpretable intermediate representations.

problem Safe motion planning for self-driving vehicles.
method Differentiable semantic occupancy representation for cost calculation in motion planning.
result Significantly outperforms state-of-the-art planners in imitating human behaviors and producing safer trajectories.

Helfer in [Pacific J. Math. 164/2 (1994), p. 321--350] was the first to produce an example of a spacelike Lorentzian geodesic with a continuum of conjugate points. In this paper we show the following result: given an interval [a,b][a,b] of IRIR and any closed subset FF of IRIR contained in ]a,b]]a,b], then there exists a Lo…

2000-11-06abs ↗pdf ↗

New analysis of annealing paths in sampling and estimation.

problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.

Workshop reviews techniques to understand neural NLP models.

problem Understanding the inner workings of neural networks in natural language processing.
method Systematic manipulation of inputs, decoding intermediate representations, modifying architectures, and testing on simplified languages.
result Various techniques can improve explainability of neural network models.

TIPRDC anonymizes data features to protect privacy while retaining useful information.

problem Privacy concerns from crowdsourced data hinder deep learning applications.
method Hybrid training method combining adversarial and mutual information estimation.
result Feature extractor hides private information while preserving original data features.

In this paper we provide a principled approach to solve a transductive classification problem involving a similar graph (edges tend to connect nodes with same labels) and a dissimilar graph (edges tend to connect nodes with opposing labels). Most of the existing methods, e.g., Information Regularization (IR), Weighted …

2012-06-26abs ↗pdf ↗

TPGR uses a tree structure to improve efficiency and effectiveness in large-scale interactive recommendation.

problem Efficiency and effectiveness in large-scale interactive recommendation systems with thousands of items.
method Tree-structured Policy Gradient (TPGR) framework for handling large discrete action spaces.
result Superior recommendation performance and significant efficiency improvement over state-of-the-art methods.