Study compares AI and static analysis for detecting buffer overflows.
problem Detecting buffer overflows in code.
method Developed s-bAbI to generate code samples, compared AI with static analysis tools.
result AI system requires extensive training data to match static analysis precision and recall.
This paper considers a transmission control problem in network-coded two-way relay channels (NC-TWRC), where the relay buffers random symbol arrivals from two users, and the channels are assumed to be fading. The problem is modeled by a discounted infinite horizon Markov decision process (MDP). The objective is to find…
New algorithm reduces costs and latency for large language model inference.
problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.
Predicts programming languages from Stack Overflow questions and snippets.
problem Incorrectly tagging programming languages in Stack Overflow questions.
method Combines NLP features from titles, bodies, and code snippets for prediction.
result Combined features classifier achieves 91.1% accuracy.
Intelligent AQM uses ECN to predict and control network congestion.
problem Challenges in finding optimal AQM parameters due to network complexity.
method Machine Learning (Neural Network for prediction, Reinforcement Learning for parameter tuning).
result Enhanced performance of AQM using ECN and existing TCP congestion control.
New model shows most users on Q&A site Stack Overflow ignore badges.
problem Understanding user behavior in Q&A websites with badges.
method Probabilistic model applied to Stack Overflow data.
result Majority of users remain apathetic to badges but still contribute.
Deep neural network predicts semantic labels for source code.
problem Difficulty in labeling and understanding new programming languages and functionalities.
method Language-agnostic deep convolutional neural network trained on Stack Overflow code snippets.
result Mean area under ROC of 0.957 and top-1 accuracy of 86.6% on Github code documents.
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.
Secure aggregation for buffered asynchronous federated learning without TEEs.
problem Privacy and convergence in buffered asynchronous federated learning.
method Developed a new protocol (BASecAgg) that ensures privacy without TEEs by carefully designing masks.
result BASecAgg achieves similar convergence guarantees as FedBuff without TEEs.
This paper uses unsupervised learning and dimensionality reduction to optimize sewer system control.
problem Challenges in controlling large sewer systems efficiently.
method Divide sewer system into subcatchments, collect factors, cluster, apply PCA, simulate control scenarios.
result Priority control measures applied to clusters with similar hydraulic characteristics yield the best overflow reduction.
Deep learning detects cyber-attacks in smart grid systems.
problem Cyber-attacks on smart grid systems.
method Deep learning-based intrusion detection system trained on industrial dataset.
result Proposed system outperforms Naive Bayes, SVM, and Random Forest.
DeepCSO model forecasts CSO events from multiple sewer structures in near real-time.
problem Forecasting Combined Sewer Overflow (CSO) events at a citywide level.
method Multi-task deep learning model combining data-driven and deterministic methods.
result Deep learning model outperforms traditional methods in CSO event forecasting.
A new buffer system improves continual learning in RL agents by adapting to changing environments.
problem Improving RL agents' ability to learn from changing environments over time.
method Multi-timescale replay buffer combined with invariant risk minimization.
result The method shows improvement over baselines in continual learning settings.
Study investigates micro-event detection on FLOSS version releases from Stack Overflow.
problem Detecting micro-events in FLOSS version release events from textual messages.
method Developed pipelines using LDA topic modeling, hSBM topics, and sentiment analysis; optimized feature spaces with RFECV; evaluated models with statistical analysis.
result Found characteristic changes in topics or sentiment features before or after FLOSS version releases.
WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.
problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.
SCC identifies 21 programming languages with 75% accuracy.
problem Classifying code snippets among 21 programming languages.
method Multinomial Naive Bayes classifier trained on Stack Overflow posts.
result SCC achieves 75% accuracy, significantly higher than PLI.
MAPO uses a memory buffer to improve policy optimization in structured prediction tasks.
problem Improving sample efficiency and robustness in policy optimization for structured prediction tasks.
method Memory Augmented Policy Optimization (MAPO) uses a memory buffer to reduce policy gradient variance.
result MAPO achieves state-of-the-art results in program synthesis and semantic parsing tasks.
CoNCRA uses CNN to find code snippets matching developer intent.
problem Finding relevant code snippets using general search engines.
method Convolutional Neural Network approach to code retrieval.
result Improved code retrieval by 5% on average, top 3 positions 80% of the time.
This work improves continual learning by selecting diverse samples for replay buffers.
problem Overcoming catastrophic forgetting in online continual learning.
method Formulates sample selection as a constraint reduction problem and uses gradient-based diversity maximization.
result Demonstrates improved performance compared to existing methods that rely on task boundaries.
This study examines how risky investments affect insurance capital valuation.
problem Standard cost-of-capital assumptions do not account for risky investments.
method Analyzed effects of allowing buffer capital investments in risky assets.
result Decomposition of buffer capital contributions varies with riskiness.
BUZz defends images from adversarial attacks using simple transformations.
problem Adversarial attacks on deep neural networks for image classification.
method Combination of deep neural networks and simple image transformations.
result Achieves significant improvement over state-of-the-art defenses with a modest drop in clean accuracy.
Regulator allocates buffers to prevent financial contagion in networks with common assets.
problem Containment of default contagion in financial networks with common asset exposures.
method Allocates nonnegative buffer vectors under linear budget constraints to maximize default or insolvency resilience margins or minimize worst-case systemic losses.
result Exact synthesis results for buffer allocation under ℓ∞ and ℓ1 uncertainty sets, showing significant gains over uniform and exposure-proportional allocations. New method scales Bayesian inference for nonlinear SSMs using buffered stochastic gradient.
problem Inference for nonlinear, non-Gaussian SSMs is computationally challenging and particle degeneracy increases with longer series.
method Extends stochastic gradient MCMC to nonlinear SSMs using particle methods and error bounds.
result Demonstrates the importance of particle buffered stochastic gradient for long sequential data.
Paper proposes ICWT method to balance sewer flow and WWTP capacity.
problem Balancing spatial mismatch of sewer flow and WWTP capacity.
method Hydraulic model and LSTM for multi-step ahead water level prediction.
result LSTM outperforms other models in predicting water levels.
LiteMORT reduces memory usage for GBDT models by 30% with improved accuracy.
problem Memory inefficiency in GBDT models, especially with adaptive compact distributions.
method Share memory, implicit merging, adaptive histogram resizing.
result Significant reduction in memory usage with improved accuracy.
Efficiently combines autoregressive and set-based models for joint distributions.
problem Joint distributions over multiple predictions from set-based models.
method Causal autoregressive buffer that caches context and captures dependencies.
result Up to 20x faster joint sampling and density evaluation, up to 7x lower memory usage.
The paper proposes a method to learn from both simulation and real-world data.
problem Training autonomous systems in simulation and applying them to real-world environments.
method Balancing samples from simulation and real-world data using a replay buffer.
result The method achieves better performance in real-world tasks compared to training only in simulation.
Paper introduces a dynamic reference frame strategy to predict events with a buffer time.
problem Lack of time buffer for predictions to enable timely action.
method Introduces a new concept of dynamic reference frame creation.
result Enables organizations to act on predictions with a buffer time.
Hierarchical GANs reduce anomaly detection costs.
problem Balancing anomaly detection accuracy and sampling costs.
method Hierarchical GANs for nonuniform sampling and buffer zones.
result Proposed GAN-based detector outperforms baseline in detection delay and average cost of error.
MER algorithm speeds up VI solving with Markovian data.
problem Solving stochastic variational inequalities with Markovian data.
method MER algorithm using multi-scale sampling from a Markovian buffer.
result Achieves faster convergence without knowing Markov chain mixing time.
A mean-reverting financial instrument is optimally traded by buying it when it is sufficiently below the estimated `mean level' and selling it when it is above. In the presence of linear transaction costs, a large amount of value is paid away crossing bid-offers unless one devises a `buffer' through which the price mus…
Investigates multi-period portfolio optimization for DC plans using buffered Probability of Exceedance.
problem Optimizing long-term Defined Contribution plans with realistic constraints and dynamic dynamics.
method Formulates and solves bilevel optimization problems for pre-commitment and time-consistent Mean-bPoE and Mean-CVaR portfolio optimization.
result Time-consistent Mean-bPoE strategies maintain investor preferences for minimum terminal wealth, unlike Mean-CVaR.
Improves on-policy RL by reusing data from multiple policies.
problem Lack of reuse of data from previous policies in on-policy RL.
method Adapts replay buffer concept to combine on- and off-policy learning.
result Method outperforms state-of-the-art on-policy RL algorithms.
DAC enhances exploration in reinforcement learning with entropy regularization.
problem Improving exploration efficiency in reinforcement learning.
method Sample-aware entropy regularization using replay buffer action distributions.
result DAC significantly outperforms existing algorithms in reinforcement learning tasks.
This work improves reinforcement learning with sparse rewards by following diverse past trajectories.
problem Challenges in reinforcement learning with sparse rewards and myopic behavior.
method Proposes a trajectory-conditioned policy to learn from a memory buffer of diverse past trajectories.
result Significantly outperforms existing methods on complex tasks with local optima.
Flexible VHDL design for multiple neural networks on FPGAs.
problem Inflexible neural network designs for FPGAs.
method Proposes a flexible VHDL structure with multiple processor groups.
result Allows training and testing of multiple neural networks on multiple FPGAs.
SOCP uses SOM to find groups and local calibration buffers for better regional coverage.
problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.
Investigates optimal pension policies in PAYG systems with forward utility and ageing population.
problem Optimal investment and pension policies in PAYG systems with sustainability and adequacy constraints.
method Non-zero volatility forward CRRA utilities, closed-form optimal policies, detailed numerical analysis.
result Characterization of optimal policies and detailed impact analysis under various scenarios.
Proportional transaction costs present difficult theoretical problems in trading algorithm design, on account of their lack of analytical tractability. The author derives a solution of DT-NT-DT form for an arbitrary model in which the the traded asset has diffusive dynamics described by one or more stochastic risk fact…
Novel asynchronous SGD method resists Byzantine attacks without server storage.
problem Asynchronous distributed learning with Byzantine attacks and failures.
method Buffered Asynchronous SGD (BASGD) and its momentum variant (BASGDm).
result BASGD and BASGDm resist non-omniscient and omniscient attacks without server storage.
Tiled Squeeze-and-Excite improves channel attention with local spatial context.
problem Improving channel attention mechanisms in neural networks.
method Proposes tiled squeeze-and-excite (TSE) framework for channel attention.
result Local context of 7 rows or columns is sufficient for matching global context performance.
Improved diffusion models for sampling from given distributions.
problem Training diffusion models to sample from a given distribution.
method Benchmarked and improved off-policy methods for diffusion sampling.
result A novel exploration strategy improves sample quality.
Experience replay helps neural networks learn new tasks without forgetting old knowledge.
problem Catastrophic forgetting in neural networks trained on non-stationary data.
method Experience replay buffers with a mixture of on- and off-policy learning.
result Experience replay can learn new tasks quickly and reduce catastrophic forgetting.
We present a semi-supervised learning algorithm for learning discrete factor analysis models with arbitrary structure on the latent variables. Our algorithm assumes that every latent variable has an "anchor", an observed variable with only that latent variable as its parent. Given such anchors, we show that it is possi…
LiDER refreshes past experiences in RL by dreaming about them.
problem Improving data efficiency in off-policy RL algorithms.
method Refreshing past experiences in a replay buffer using the current policy.
result LiDER consistently improves performance in Atari games.
Proposes a new policy gradient algorithm to improve reinforcement learning efficiency and stability.
problem Inefficiency and instability of DDPG in practical applications, and difficulty in controlling Q estimation bias and variance.
method Introduces a Regularly Updated Deterministic (RUD) policy gradient algorithm.
result The RUD algorithm makes better use of new data and has lower Q value variance, leading to improved performance.
Improves VAE training by refining variational parameters with BSVI.
problem Amortized inference in VAEs leads to suboptimal variational parameters and the amortization gap.
method Proposes BSVI, a refinement procedure using SVI's importance weights.
result Training VAEs with BSVI yields improved performance compared to SVI.
The paper optimizes pension policies with guarantees and sustainability constraints.
problem Designing optimal pension policies with guarantees and sustainability constraints.
method Dynamic utility model, stochastic domain, overlapping generations, time-consistent decision criterion.
result Optimal investment/pension policy computed for a general framework.