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.
There is a perceived trade-off between machine learning code that is easy to write, and machine learning code that is scalable or fast to execute. In machine learning, imperative style libraries like Autograd and PyTorch are easy to write, but suffer from high interpretive overhead and are not easily deployable in prod…
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.
ProGraML uses graph-based machine learning to improve program optimization and analysis.
problem Improving program optimization and analysis with machine learning.
method Low-level, language agnostic graph representation and message passing neural networks.
result ProGraML achieves an average 94.0 F1 score on a benchmark dataset, significantly outperforming state-of-the-art approaches.
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…
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…
Proposes a fix for IRS calculation of Obamacare tax credits.
problem IRS iteration leads to divergent sequences for some self-employed taxpayers.
method Introduces a bisection procedure to calculate premium tax credits.
result Bisection procedure works for simple tax returns and those receiving credits in advance.
Relay simplifies deep learning compilation across diverse hardware.
problem Challenges in extending DL frameworks to diverse models and hardware.
method Relay introduces a unified, expressive intermediate representation and extension mechanisms for hardware portability.
result Relay achieves competitive performance across various hardware platforms.
Developed AI models for multi-gas detection in near IR spectrums.
problem Detecting multiple gases in near IR spectrums.
method Used Monte Carlo KNN and multi-resolution CNN, synthesized near IR spectrums, optimized kernel sizes and channels.
result Multi-resolution CNN outperforms other models.
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.
The efficiency of deep machine learning for automatic delineation of tumor areas has been demonstrated for intraoperative neuronavigation using active IR-mapping with the use of the cold test. The proposed approach employs a matrix IR-imager to remotely register the space-time distribution of surface temperature patter…
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.
The paper shows compatibility between two quantum maps for surfaces and 3-manifolds.
problem Connecting quantum trace and UV-IR maps for surfaces and 3-manifolds.
method Analyzing compatibility under triangulation changes and using skein modules.
result Compatibility of quantum trace and UV-IR maps for surfaces and 3-manifolds.
New model-independent compact representations of imaginary-time data are presented in terms of the intermediate representation (IR) of analytical continuation. This is motivated by a recent numerical finding by the authors [J. Otsuki et al., arXiv:1702.03056]. We demonstrate the efficiency of the IR through continuous-…
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…
Brenier isotonic regression extends multi-output isotonic regression using optimal transport.
problem Enforcing cyclic monotonicity in multi-output regression.
method Leverage Kantorovich's optimal transport to find cyclically monotone couplings.
result Brenier isotonic regression outperforms baselines in probability calibration.
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 (IR∗) 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 IR∗ 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.
Deep analysis of KV-Poisson structures and new invariant computed.
problem Understanding KV-Poisson structures and their properties.
method Classification, properties analysis, and computation of Cohomological groups.
result KV-Poisson structures give rise to a new Cohomological invariant.
Quantum map counts BPS states in special theories.
problem Computing protected spin characters in class S theories.
method Geometric approach from 5D supersymmetric Yang-Mills theory.
result Explicit computation of protected spin characters in various examples.
Test for fairness in IR systems based on protected variables.
problem Unfairness in IR systems due to correlation with protected variables.
method Statistical test for 'distribution parity' in top-K IR results.
result Ensures fairness in IR systems for all users.
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.
We study that the n−graphs defining by smooth map $f:\Om\subset \ir{n}\to \ir{m}, m\ge 2,$ in $\ir{m+n}$ of the prescribed mean curvature and the Gauss image. We derive the interior curvature estimates $$\sup_{D_R(x)}|B|^2\le\f{C}{R^2}$$ under the dimension limitations and the Gauss image restrictions. If there is no…
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] of IR and any closed subset F of IR contained in ]a,b], then there exists a Lo…
BeBold improves exploration in sparse-reward tasks by regulating visitation counts.
problem Efficient exploration in deep reinforcement learning under sparse rewards.
method Regulated difference of inverse visitation counts.
result BeBold solves 12 challenging tasks in MiniGrid with fewer steps than previous state-of-the-art.
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 …
Paper relates new compactification to classical moduli space.
problem Relating new compactification to classical moduli space.
method Defining a continuous finite-to-one surjection between compactifications.
result Uniform upper bound on cardinalities of fibers.
Study of 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) corrections and O(lp6) corrections in the MQGP background. result Discovery of O(R4) corrections and G-structure classification of underlying geometries. Suppose M is a non-compact connected n-manifold without boundary, DD(M) is the group of C^\infty-diffeomorphisms of M endowed with the Whitney C^\infty-topology and DD_0(M) is the identity connected component of DD(M), which is an open subgroup in the group DD_c(M) \subset DD(M) of compactly supported diffeomorphisms o…
In the eyes of a rationalist like Descartes or Spinoza, human reasoning is flawless, marching toward uncovering ultimate truth. A few centuries later, however, culminating in the work of Kahneman and Tversky, human reasoning was portrayed as anything but flawless, filled with numerous misjudgments, biases, and cognitiv…
Novel process model for metabolomics data analysis.
problem Analyzing complex metabolomics data.
method Data-driven and hypothesis-driven data mining approaches using various techniques.
result Demonstrated applicability and strengths of MeKDDaM model.
Unified data representation learning improves non-parametric two-sample testing.
problem Improving non-parametric two-sample testing accuracy.
method Proposes RL-TST framework combining IRs and DRs for better test power.
result RL-TST outperforms existing methods by leveraging both IRs and DRs.
In this study, we investigated the (K,H), (K,K_{II}), (H,K_{II})-Weingarten and (K,H),(K,K_{II}),(H,K_{II}) and (K,H,K_{II})-linear Weingarten canal surfaces in IR^3.
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.
New algorithm improves graph-based active learning by identifying unexplored regions.
problem Improving graph-based active learning by identifying unexplored regions.
method Poisson Reweighted Laplacian Uncertainty Sampling (PWLL) with a diagonal perturbation.
result PWLL effectively identifies unexplored regions in graph-based data.
Given an open book decomposition (Σ,τ) of a three manifold Y, Thurston and Winkelnkemper [TW] construct a specific contact form a on Y. Given a spin-c Dirac operator D on Y, the contact form naturally associates a one parameter family of Dirac operators $D_r = D - \frac{ir}{2}\cl(a)$ for r≥0. When $r>>…
Bayesian analysis shows unlabeled data improve graph-based semi-supervised learning.
problem Improving semi-supervised learning with limited labeled data.
method Bayesian nonparametric approach using unlabeled data for graph-based learning.
result Posterior contracts optimally around the truth with sufficient unlabeled data.
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.
In this paper, we present a deep learning (DL) algorithm for channel estimation in communication systems. We consider the time-frequency response of a fast fading communication channel as a two-dimensional image. The aim is to find the unknown values of the channel response using some known values at the pilot location…
End-to-end graph-based SSL learns all graph factors dynamically.
problem Learning quality of graph in SSL is crucial but difficult.
method Proposes an end-to-end approach to optimize all graph factors.
result Demonstrates effectiveness on benchmark datasets.
Graph-based methods for anomaly detection and semi-supervised learning.
problem Detecting unusual clinical actions and anomalies in hospital data.
method Label propagation, harmonic solution, regularization, graph connectivity analysis.
result Effective anomaly detection and semi-supervised learning methods for healthcare data.
In this paper, we study the timelike tubular Weingarten surfaces in 3-dimensional Minkowski space IR13.We have obtained some conditions for being (KII,H), (KII,K), timelike tubular Weingarten surfaces where are the second Gaussian curvature the Gaussian curvature and the mean curvature, respectively.
Improves graph-based active learning for non-Gaussian models.
problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.
We obtain new curvature estimates and Bernstein type results for minimal n−submanifolds in $\ir{n+m},\, m\ge 2$ under the condition that the rank of its Gauss map is at most 2. In particular, this applies to minimal surfaces in Euclidean spaces of arbitrary codimension.