New ShuffleNASNets improve efficiency and speed of CNN models.
problem Complexity and inefficiency of search-based neural architecture designs.
method Adopted and enhanced Efficient Neural Architecture Search (ENAS) with ShuffleNet V2 principles.
result Achieved significantly less complex, faster, and more efficient CNN models.
UGConvs improve CNN accuracy with unitary transforms.
problem Improving CNN accuracy with richer representations.
method UGConvs combine group convolutions with unitary transforms.
result HadaNets achieve similar accuracy to circulant networks with lower complexity.
DCN-V2 improves deep & cross network for web-scale learning to rank systems.
problem Efficiently learning feature interactions in large-scale recommender systems.
method Proposes DCN-V2, an improved framework for deep & cross network learning.
result DCN-V2 outperforms state-of-the-art algorithms on benchmark datasets.
Study optimal liquidation strategies on Uniswap v2/v3 considering price impact.
problem Optimal liquidation of large positions on Uniswap v2/v3 under transient price impact.
method Dynamic programming and numerical approximation for Uniswap v3, closed-form solutions for v2.
result Obtained optimal strategies for both Uniswap v2 and v3, showing how liquidity profile influences them.
Enhances neural architecture search efficiency and prevents performance collapse.
problem Improving memory efficiency and preventing performance collapse in neural architecture search.
method Employing continuous relaxation strategy and gradient-based optimization for over-parameterized BCNN construction, introducing Confident Learning Rate and partial channel connections.
result NAS-v2 delivers state-of-the-art search efficiency on CIFAR-10 and ImageNet.
GENESIS-V2 infers unordered object representations without iterative refinement.
problem Unsupervised learning of unordered object representations for complex images.
method Stochastic stick-breaking process for clustering pixel embeddings.
result GENESIS-V2 outperforms recent baselines in unsupervised image segmentation and scene generation.
Study analyzes risk management in Aave and Compound lending protocols, finding v3 better than v2.
problem Risk management in decentralized lending protocols.
method Cross-version and cross-chain analysis using fixed effects model.
result v3 protocols have better risk management, with stronger impact on L2 blockchains.
MobileNet-v2 improves re-ID on edge devices with mixed precision.
problem Real-time person re-identification in edge devices with limited resources.
method Mixed precision training (FP32 and FP16) for MobileNet-v2 on edge nodes.
result Mixed precision training improves inference throughput and reduces power consumption.
IPO Finance Agent evaluates LLMs on SpaceX IPO due diligence, surpassing Finance Agent v2.
problem Evaluating language models on financial tasks like IPO due diligence.
method Introducing IPO Finance Agent and an evaluator-optimizer pipeline.
result The best-performing model reaches 79.4% accuracy at 0.30 USD per query.
IPO Finance Agent extends Finance Agent v2 for SpaceX S-1 filings, improving accuracy and cost-efficiency.
problem Evaluating IPO due diligence tasks with long-form documents.
method Extended task domain, improved agentic harness with contextual retrieval, automated rubric generation.
result Best-performing model reaches 79.8% accuracy, cost-efficient model at 77.2% with 0.05 USD per query.
Meta-SAC automatically tunes SAC's entropy temperature for better exploration.
problem Exploration-exploitation dilemma in reinforcement learning.
method Meta-SAC uses metagradient and a novel meta objective to automatically adjust SAC's entropy temperature.
result Meta-SAC outperforms SAC-v2 by 10% on the humanoid-v2 task.
Novel unsupervised LSTM method for video frame prediction.
problem Video frame prediction with limited labeled data.
method Inception-based LSTM architecture.
result Inception-based LSTM outperforms convolutional LSTM and has better performance than Inception v2 LSTM.
Although Generative Adversarial Networks (GANs) have shown remarkable success in various tasks, they still face challenges in generating high quality images. In this paper, we propose Stacked Generative Adversarial Networks (StackGAN) aiming at generating high-resolution photo-realistic images. First, we propose a two-…
Paper explores pruning and quantisation to compress neural networks.
problem Reduces computational and memory costs of deep neural networks.
method Investigates network pruning and quantisation for AlexNet, ShuffleNet, and MobileNet.
result Pruning and quantisation compress networks to less than half their size and improve efficiency.
Uniswap analyzes liquidity provider risk and impermanent loss.
problem Risk and loss for liquidity providers in decentralized exchanges.
method Improved impermanent loss function for Uniswap v2, v3 comparison.
result Improved impermanent loss function for Uniswap v2.
For a company looking to provide delightful user experiences, it is of paramount importance to take care of any customer issues. This paper proposes COTA, a system to improve speed and reliability of customer support for end users through automated ticket classification and answers selection for support representatives…
Two new algorithms speed up TreeSHAP computation for tree-based models.
problem Slow computation of SHAP values on tree-based models.
method Two new algorithms, Fast TreeSHAP v1 and v2, designed to improve computational efficiency.
result Fast TreeSHAP v2 is 2.5x faster than TreeSHAP, with slightly higher memory usage.
LG algorithm finds profitable trading paths in decentralized exchanges.
problem Identifying optimal trading paths in decentralized exchanges.
method Line-graph-based algorithm (LG) for efficient route discovery.
result LG consistently identifies more profitable paths than DFS with comparable costs.
WALL-E accelerates reinforcement learning by parallelizing experience collection.
problem Slow experience collection time in reinforcement learning.
method Parallel rollout samplers to speed up experience generation.
result Achieved higher average rewards with parallel processes.
The profitability of CPMMs is significantly impacted by mint and burn fees.
problem Understanding the profitability of decentralized exchanges.
method Formalized liquidity providers' profitability conditions, studied the effect of mint and burn fees, and compiled a large data set from Uniswap V2 transactions.
result The profitability of liquidity provision is severely affected by mint and burn costs.
We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions, essentially completely rewritten in places.
In this paper we propose the macroblock scaling (MBS) algorithm, which can be applied to various CNN architectures to reduce their model size. MBS adaptively reduces each CNN macroblock depending on its information redundancy measured by our proposed effective flops. Empirical studies conducted with ImageNet and CIFAR-…
PLS-Lasso integrates dimension reduction into regression for financial index tracking.
problem Dimension reduction and regression are traditionally treated separately in multivariate data analysis.
method PLS-Lasso integrates dimension reduction directly into the regression process, presenting two formulations: PLS-Lasso-v1 and PLS-Lasso-v2.
result PLS-Lasso-v1 and PLS-Lasso-v2 outperform Lasso in financial index tracking.
We formalize how markets aggregate via arbitrage and quantify liquidity loss.
problem How financial markets aggregate and the loss of liquidity.
method Characterize markets via utility functions, use thermodynamics analogy, derive limit order book representation, compute aggregation loss.
result Arbitrage-mediated aggregation leads to market-dynamical entropy quantifying liquidity loss.
v2: An additional assumption was added in Theorem 4.8. In order to show that a connected abelian group is admissible on the site of locally compact spaces we must in addition assume that it is locally topologically divisible. This condition is used in the proof of Lemma 4.62.
New metric to measure liquidity position PNL, delta hedging algorithm for automated market makers.
problem Vulnerability of liquidity positions to price changes in underlying assets.
method Proposes a new metric for measuring PNL, delta hedging algorithm for various AMMs.
result New metric more accurately measures net value change due to price movement.
Joint network for real-time object detection and semantic segmentation.
problem Real-time object detection and semantic segmentation for automated driving.
method Shared encoder for object detection and semantic segmentation, using YOLO v2 and FCN8 decoders.
result Joint network achieves the same accuracy as separate networks and 30 fps for 1280x384 resolution.
A new Universal Activation Function improves performance across various machine learning tasks.
problem Achieving near optimal performance in different machine learning tasks.
method Optimization algorithms evolve the UAF's parameters to match the optimal activation function for each task.
result The UAF converges to near optimal performance in classification, quantification, and reinforcement learning tasks.
The paper investigates cyclic arbitrage opportunities in decentralized exchanges.
problem Price discrepancies in decentralized exchanges lead to arbitrage opportunities.
method Theoretical framework and analysis of transaction-level data.
result Traders have executed over 292,606 cyclic arbitrages over eleven months, exploiting more than 138 million USD in revenue.
The possible existence of a complex structure on the 6-sphere has been a famous unsolved problem for over 60 years. In that time many "solutions" have been put forward, in both directions. Mistakes have always been found. In this paper I present a short proof of the non-existence, based on ideas developed, but not full…
We prove a subelliptic estimate for systems of complex vector fields under some assumptions that generalize the essential pseudoconcavity for CR manifolds and Hörmander's bracket condition for real vector fields. Applications are given to prove the hypoellipticity of first order systems and second order partial diffe…
New benchmark predicts cardiometabolic risk from accelerometer data, with varying accuracy.
problem Lack of accurate tabular benchmarks for cardiometabolic risk from accelerometer data.
method Tabular learning methods (ridge regression, XGBoost, TabPFN v2) applied to NHANES data.
result TabPFN v2 achieves best performance, but triglycerides remain largely unpredictable.
Paper establishes baselines for offline RL from visual observations.
problem Challenges in offline reinforcement learning from visual observations with continuous action spaces.
method Simple baselines and benchmarking tasks for offline RL from visual observations.
result Simple modifications to existing online RL algorithms outperform existing offline RL methods.
Proposes a credit scoring system for Aave accounts.
problem Scoring the creditworthiness of DeFi accounts.
method Tree-based binary classifier for predicting delinquency.
result Validated the credit scoring system for Aave accounts.
A simple DQN-based multi-agent RL system for binary actions.
problem Complexity and training issues in multi-agent reinforcement learning.
method Shared state and rewards, agent-specific actions, experience replay pool.
result Better performance and faster convergence compared to conventional methods.
PFN-TS uses Thompson sampling with PFNs to improve contextual bandit performance.
problem Improving contextual bandit performance using Thompson sampling with prior-data fitted networks.
method PFN-TS converts PFN posterior predictives into mean-reward samples using a subsampled predictive central limit theorem.
result PFN-TS achieves the best average rank across nonlinear synthetic and OpenML classification-to-bandit benchmarks.
This paper introduces STAP to measure DEX efficiency and shows better routing algorithms increase DEX performance and stakeholder benefits.
problem Measuring and improving the efficiency of decentralized exchanges (DEXs).
method Introduces STAP as a measure of DEX efficiency and compares two routing algorithms.
result Better routing algorithms improve DEX efficiency and stakeholder benefits.
AutoShuffleNet learns permutation matrices in CNNs for improved accuracy.
problem Manual design of channel shuffling in ShuffleNet.
method Learning permutation matrices via an exact Lipschitz continuous penalty in deep learning.
result Improved classification accuracies on CIFAR-10 and ImageNet datasets.
BERTopic improves financial text analysis with FinTextSim's contextual embeddings.
problem Analyzing financial text data for insights and predictions.
method Integrates BERTopic with FinTextSim for topic modeling and clustering.
result BERTopic performs better with FinTextSim's embeddings, improving topic clarity and reducing misclassification.
LeanConvNets reduces CNN costs without sacrificing accuracy.
problem High computational cost in fully-coupled CNNs.
method Sparsifying fully-coupled operators in CNNs.
result LeanConvNets achieve similar accuracy to state-of-the-art networks but with lower computational cost.
Study finds recurring patterns in cryptocurrency volatility and liquidity.
problem Recurring patterns in volatility and liquidity of major cryptocurrencies.
method Data from two centralized exchanges and a decentralized exchange analyzed for patterns.
result Systematic patterns in volatility and liquidity across different timeframes.
Paper evaluates deadline-ILS on insider trading contracts, finding it distinguishes signals from noise.
problem Deadlines in insider trading contracts and information leakage detection.
method Empirical evaluation using FFIC dataset, hazard-rate estimation, cross-market wallet analysis.
result Deadline-ILS distinguishes signal from proxy artefact, with a significant shift in magnitude.
Extends T-duality to more general fibrations, proving isomorphic cohomology and algebroids.
problem Extending T-duality to transgressive fibrations.
method Introducing Clifford--Courant algebroids and proving isomorphisms.
result Transgressive T-duals have isomorphic twisted cohomology and Clifford--Courant algebroids.
Cylindrical contact homology computed for links of simple singularities.
problem Computing cylindrical contact homology for links of simple singularities.
method Perturbing degenerate contact form on S3/G with an invariant Morse function, achieving nondegeneracy up to an action threshold. Recovers cylindrical contact homology via direct limit of action filtered homology groups. result Ranks of cylindrical contact homology groups are given in terms of ∣extConj(G)∣, demonstrating a form of the McKay correspondence. AdaptiveLRF adapts low-rank factorization for neural networks to improve generalization without sacrificing accuracy.
problem Overfitting in neural networks, especially in shallow and deep models.
method Adaptive Low-Rank Factorization (LRF) applied to neural network layers based on their complexity.
result AdaptiveLRF improves generalization without significantly decreasing training speed or accuracy.
Kaleidoscope matrices improve model quality and inference speed.
problem Choosing structured linear transformations for efficiency and accuracy.
method Introduce kaleidoscope matrices that can capture any structured matrix with near-optimal space and time complexity. Learn these matrices automatically within end-to-end pipelines.
result Kaleidoscope matrices can improve model quality and inference speed.
Study growth of LP wealth in G3Ms affected by trading fees and arbitrage.
problem Analyzing profitability of LPs in G3Ms under trading fees and arbitrage.
method Stochastic reflected diffusion processes to model G3M dynamics.
result Long-term expected logarithmic growth of LP wealth calculated.
New findings show non-uniqueness in Ricci flow solutions for dimensions n≥5.
problem Non-uniqueness in Ricci flow solutions for dimensions n≥5.
method Exhibited a family of asymptotically conical gradient shrinking solitons with non-unique forward continuations.
result Non-uniqueness of Ricci flow solutions for dimensions n≥5.